Bisimulation Equivalence and Divergence in CCS

D. Walker

Abstract: By introducing `convergence predicates' on the set of terms of the language of CCS, behavioural preorders based upon the idea of bisimulation but refining the notion of bisimulation equivalence and incorporating explicit treatments of `divergence' are defined. The associated precongruence relations are characterized and complete axiomatizations of these relations for the sets of closed finite terms and regular expressions are presented.

A revised version of this report was published as ``Bisimulation and Divergence'' in Information and Computation, 85 (2) 1990, pp.202--241.

LFCS report ECS-LFCS-87-29

Previous | Index | Next