MODAL-LOGICS FOR MOBILE PROCESSES
UNSPECIFIED (1993) MODAL-LOGICS FOR MOBILE PROCESSES. THEORETICAL COMPUTER SCIENCE, 114 (1). pp. 149-171. ISSN 0304-3975Full text not available from this repository.
In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterization in terms of a simple modal logic (sometimes called Hennessy-Milner logic). This paper first defines two forms of bisimulation equivalence for the pi-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 characterize the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice. The results are applicable to most value-passing process algebras.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||THEORETICAL COMPUTER SCIENCE|
|Publisher:||ELSEVIER SCIENCE BV|
|Date:||14 June 1993|
|Number of Pages:||23|
|Page Range:||pp. 149-171|
Actions (login required)