Sciweavers

276 search results - page 44 / 56
» Bisimulation for quantum processes
Sort
View
MFCS
1997
Springer
14 years 16 days ago
Dependency-Based Action Refinement
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
Arend Rensink, Heike Wehrheim
ENTCS
2008
106views more  ENTCS 2008»
13 years 9 months ago
Towards Verifying Model Transformations
In model-based software development, a complete design and analysis process involves designing the system using the design language, converting it into the analysis language, and ...
Anantha Narayanan, Gabor Karsai
FOSSACS
2004
Springer
14 years 2 months ago
safeDpi: A Language for Controlling Mobile Code
safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, ...
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
NIPS
2001
13 years 10 months ago
An Efficient Clustering Algorithm Using Stochastic Association Model and Its Implementation Using Nanostructures
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
Takashi Morie, Tomohiro Matsuura, Makoto Nagata, A...
LPNMR
1990
Springer
14 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote