Modal logics for mobile processes
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.
KeywordsInduction Hypothesis Modal Logic Input Action Process Algebra Communicate Sequential Process
Unable to display preview. Download preview PDF.
- Hennessy, M., Algebraic Theory of Processes, MIT Press, 1988.Google Scholar
- Hennessy, M. and Milner, R., Algebraic Laws for Non-determinism and Concurrency, Journal of ACM, Vol 32, pp137–161, 1985.Google Scholar
- Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.Google Scholar
- Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, Volume 92, Springer-Verlag, 1980.Google Scholar
- Milner, R., Communication and Concurrency, Prentice Hall, 1989.Google Scholar
- Milner, R., Parrow, J. and Walker, D., A Calculus of Mobile Processes, Part I, Reports ECS-LFCS-89-85, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1989. Also to appear in J. Information and Computation.Google Scholar
- Milner, R., Parrow, J. and Walker, D., A Calculus of Mobile Processes, Part II, Reports ECS-LFCS-89-86, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1989. Also to appear in J. Information and Computation.Google Scholar
- Park, D.M.R., Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science, Vol 104, Springer Verlag, 1980.Google Scholar