Bisimulation and Divergence

Abstract Behavioural preorders based on the idea of bisimulation but refining the notion of bisimulation equivalence and providing explicit treatments of the phenomenon of divergence in communicating systems are investigated. Particular study is made of these preorders in the context of Milner's Calculus of Communicating Systems. The precongruence relations generated by the preorders are characterized and axiomatized on the classes of finite closed terms and sequential terms. A verification technique based on the theory of the preorders is introduced and illustrated.

[1]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[4]  Kim G. Larsen,et al.  Compositional Proofs by Partial Specification of Processes , 1988, MFCS.

[5]  Matthew Hennessy,et al.  A Term Model for CCS , 1980, MFCS.

[6]  D. J. Walker,et al.  Bisimulations and divergence , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[7]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..