In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterisation in terms of a simple modal logic (sometimes called Hennessy-Milner logic. This paper first defines two forms of bisimulation equivalence for the π-calculus, a process algebra which allows dynamic reconfiguration among processes; it then explores a family of possible logics, with different modal operators. It is proven that two of these logics characterise the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice.
|Title of host publication||CONCUR '91|
|Subtitle of host publication||2nd International Conference on Concurrency Theory Amsterdam, The Netherlands, August 26–29, 1991 Proceedings|
|Number of pages||16|
|Publication status||Published - 1991|