A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Communicating sequential processes
Communications of the ACM
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
Formal Description Technique Lotos: Results of the Esprit Sedos Project
Formal Description Technique Lotos: Results of the Esprit Sedos Project
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Power simulation and its relation to traces and failures refinement
Theoretical Computer Science
| Hi-index | 0.00 |
To find congruence relations proved more difficult for synchronous message passing than for asynchronous message passing. As well-known, trace equivalence of state-machines, which represents to a congruence relation for asynchronous computations, is not a congruence relation for the classical operators of parallel composition as found in process algebras with synchronous message passing. In the literature we find two fundamentally different proposals to define congruence relations for synchronous message passing systems. One is using David Park's bisimulation used by Robin Milner for his Calculus of Communicating Systems (CCS) which introduces a class of relations between systems with synchronous message passing, the other one is an equivalence relation, introduced by the denotational semantics, given by Tony Hoare for a process algebra like Communicating Sequential Processes (CSP), based on so-called readiness, refusal and failure concepts. In this little note we analyze the question whether the equivalence relation, introduced by denotational semantics is in fact a bisimulation.