Bisimulation Relation Research Articles

A true concurrency model of CCS semantics

Degano et al. (1989) introduced AC/E systems (augmented C/E systems) to give a true concurrency semantics to CCS. But the true concurrency was not complete. There was no true concurrency for recursive agents (like < x>. e 1| e 2) and nondeterminant agents (like e 1| e 2+ e 3| e 4). Also the concept of bisimulation has not been transplanted to AC/E systems. This paper defines a complete true concurrency model of CCS by exploiting the potential concurrency of any CCS agent to its full strength. It introduces a kind of multilayered Petri nets, called NP/R nets, to define the processes on AC/E systems. We also introduced the notion of bisimulation of groups of NP/R nets and proved that this bisimulation relation can determine the CCS bisimulation uniquely.

Congruent weak bisimulation with dense real-time

New definitions for connectives in a real-time process algebra are introduced, for which the natural weak bisimulation relation is a congruence. Two kinds of weak bisimulation can be distinguished: step and path bisimulation.

Testing equivalence as a bisimulation equivalence

Abstract In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. On the basis of these results, it is possible to use algorithms for determining the (pre)bisimulation relations in the case of finite-state transition systems to compute the testing relations.

Axiom System Induced by CTL* Logic

We discuss some of the problems concerning bisimulation relations over behaviour expressions representing non-sequential systems. The kind of bisimulation we investigate is derived from the notion of bisimulation relation between two Kripke structures, which provides a full characterisation of semantical equivalence of such structures w.r.t. the CTL* branching time temporal logic without the next-time operator. This new bisimulation on behaviour expressions, called CTL*-bisimulation, induces a congruence on recursion-free behaviour expressions, and in this paper we derive a sound and complete axiom system for this congruence.