Abstract
We study the problem of verifying general temporal and functional properties of mobile and dynamic process networks, cast in terms of the π-calculus, Much of the expressive power of this calculus derives from the combination of name generation and communication (to handle mobility) with dynamic process creation. In the paper we introduce the π-μ-calculus an extension of the modal mu-calculus with name equality, inequality, first-order universal and existential quantification, and primitives for name input and output as an appropriate temporal logic for the π-calculus. A compositional proof system is given with the scope of verifying dynamic networks of π-calculus agents against properties specified in this logic. The proof system consists of a local part based, roughly, on the classical sequent calculus extended with data structures for private names, and rules to support process structure dependent reasoning. In addition the proof system contains a rule of discharge to close well-founded cycles in the proof graph. The proof system is shown to be sound in general and weakly complete for the non-recursive fragment of the specification logic. We also obtain a weak completeness result for recursive formulas against finite-control calculus processes. Two examples are considered. The first example is based on Milner’s encoding of data types into the π-calculus specifically the natural numbers. This encoding is interesting from the point of view of verification, since it makes essential use of all the distinguishing features of the π-calculus including dynamic process creation. Corresponding to the encoding of natural numbers into the π-calculus we propose an encoding of the type of natural numbers into the π-μ-calculus and establish some type correctness properties. As the second example we consider a garbage-collecting unbounded buffer (which dynamically create and destroy buffer cells) and show how to establish absence of spurious output of such a system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Amadio and M. Dam. A modal theory of types for the π-calculus. In Proc. FTRTFT’96, Lecture Notes in Computer Science, 1135:347–365, 1996.
Henrik Reif Andersen, Colin Stirling, and Glynn Winskel. A compositional proof system for the modal π-calculus. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 144–153, Paris, France, 4–7 July 1994. IEEE Computer Society Press.
J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Programming in Erlang (Second Edition). Prentice-Hall International (UK) Ltd., 1996.
M. Dam. Model checking mobile processes. Information and Computation, 129:35–51, 1996.
M. Dam. Proving properties of dynamic process networks. Information and Computation, 140:95–114, 1998.
M. Dam, L.-å. Fredlund, and D. Gurov. Toward parametric verification of open distributed systems. In Compositionality: the Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Springer, 1536:150–185, 1998.
M. Dam and D. Gurov. Compositional verification of CCS processes. In Proc. PSI’99, 1999.
D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to the monadic second order logic. In Proc. CONCUR’94, Lecture Notes in Computer Science, 1119:263–277, 1996.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
R. Milner. The polyadic π-calculus A tutorial. Technical Report ECSLFCS-91-180, Laboratory for the Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.
R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119–141, 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–40 and 41–77, 1992.
R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114:149–171, 1993.
D. Park. Finiteness is mu-Ineffable. Theoretical Computer Science, 3:173–181, 1976.
D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69–97, 1996.
Davide Sangiorgi. From π-calculus to Higher-Order π-calculus — and back. in Proc. TAPSOFT’93 Lecture Notes in Computer Science, 668:151–166, 1993.
A. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Proc. LICS, pages 420–430, 26–29 1995.
C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311–347, 1987.
D. Walker. Objects in the π-calculus. Information and Computation, 116:253–271, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Dam, M. (2003). Proof Systems for π-Calculus Logics. In: de Queiroz, R.J.G.B. (eds) Logic for Concurrency and Synchronisation. Trends in Logic, vol 15. Springer, Dordrecht. https://doi.org/10.1007/0-306-48088-3_4
Download citation
DOI: https://doi.org/10.1007/0-306-48088-3_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-1270-9
Online ISBN: 978-0-306-48088-1
eBook Packages: Springer Book Archive