Abstract
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.
Supported by a Senior Research Fellowship awarded by the British Science and Engineering Research Council.
Supported by the Swedish Board of Technical Development under project 89-01218P CONCUR and by Swedish Telecom under project PROCOM.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hennessy, M., Algebraic Theory of Processes, MIT Press, 1988.
Hennessy, M. and Milner, R., Algebraic Laws for Non-determinism and Concurrency, Journal of ACM, Vol 32, pp137–161, 1985.
Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.
Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, Volume 92, Springer-Verlag, 1980.
Milner, R., Communication and Concurrency, Prentice Hall, 1989.
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.
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.
Park, D.M.R., Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science, Vol 104, Springer Verlag, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milner, R., Parrow, J., Walker, D. (1991). Modal logics for mobile processes. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_80
Download citation
DOI: https://doi.org/10.1007/3-540-54430-5_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54430-2
Online ISBN: 978-3-540-38357-4
eBook Packages: Springer Book Archive