scholarly journals An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

2017 ◽  
Vol 18 (2) ◽  
pp. 1-34 ◽  
Author(s):  
Jan Friso Groote ◽  
David N. Jansen ◽  
Jeroen J. A. Keiren ◽  
Anton J. Wijs
Keyword(s):  
Branching Bisimulation

scholarly journals Branching bisimulation congruence for probabilistic systems

2012 ◽  
Vol 413 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Suzana Andova ◽  
Sonja Georgievska ◽  
Nikola Trčka
Keyword(s):  
Probabilistic Systems ◽  
Branching Bisimulation

An Axiomatization for Regular Processes in Timed Branching Bisimulation

1997 ◽  
Vol 32 (3,4) ◽  
pp. 329-340 ◽  
Author(s):  
Wan Fokkink
Keyword(s):  
Branching Bisimulation

scholarly journals Branching Bisimulation Congruence for Probabilistic Systems

2008 ◽  
Vol 220 (3) ◽  
pp. 129-143 ◽  
Author(s):  
Nikola Trčka ◽  
Sonja Georgievska
Keyword(s):  
Probabilistic Systems ◽  
Branching Bisimulation

scholarly journals Relations among quantum processes: bisimilarity and congruence

2006 ◽  
Vol 16 (3) ◽  
pp. 407-428 ◽  
Author(s):  
MARIE LALIRE
Keyword(s):  
Quantum Communication ◽  
Operational Semantics ◽  
Parallel Composition ◽  
Quantum Processes ◽  
Algebraic Notation ◽  
Distributed Computations ◽  
Quantum Objects ◽  
Branching Bisimulation ◽  
Classical Computing ◽  
Process Algebraic

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and distributed quantum computations and quantum communication protocols, communications over quantum channels that move qubits physically from one place to another must also be taken into account.Inspired by classical process algebras, which provide a framework for modelling cooperating computations, a process algebraic notation is defined. This notation provides a homogeneous style for formal descriptions of concurrent and distributed computations comprising both quantum and classical parts. Based upon an operational semantics that makes sure that quantum objects, operations and communications operate according to the postulates of quantum mechanics, an equivalence is defined among process states considered as having the same behaviour. This equivalence is a probabilistic branching bisimulation. From this relation, an equivalence on processes is defined. However, it is not a congruence because it is not preserved by parallel composition.

Sign in / Sign up

Export Citation Format

Share Document