A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Process algebra: a unifying approach
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
Bisimulation is an equivalence relation widely used for comparing processes expressed in CCS and related process calculi [1,6,8,9]. Simulation is its asymmetric variant. The advantages of bisimilarity are simplicity, efficiency and variety. Proofs based bisimulation for particular programs can often be delegated to a model checker. Refinement is a weaker asymmetric relation used for the same purpose in CSP [2,3,14]. Its advantages are abstraction, expressive power and completeness. Refinement permits proofs of more equations and inequations than bisimilarity. When bisimulation and refinement are reconciled, all their distinctive advantages can be combined and exploited whenever the occasions demands. This paper shows how to link these two approaches by introducing an observation-preserving mapping, which gives rise a Galois connection between simulation and refinement. The same mapping is also applicable to coincide barbed simulation with failures/divergence refinement.