276 search results - page 9 / 56 » Bisimulation for quantum processes |
ENTCS
2006
13 years 9 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
CEC
2003
IEEE
14 years 2 months ago
2003
IEEE
Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...
LICS
1991
IEEE
14 years 15 days ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
APLAS
2007
ACM
14 years 1 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
ICFP
1996
ACM
14 years 1 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...