Abstract
An account of the basic theory of confluence in the π-calculus is presented, techniques for showing confluence of mobile systems are given, and the utility of some of the theory presented is illustrated via an analysis of a distributed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. F. Groote and M. Sellink. Confluence for process verification. In Proceedings of CONCUR'95, pages 204–218. Springer, 1995.
K. Honda. Types for dyadic interaction. In CONCUR'93, pages 509–523. Springer, 1993.
N. Kobayashi, B. Pierce, and D. Turner. Linearity and the pi-calculus. Principles of Programming Languages, 1996.
X. Liu and D. Walker. Confluence of processes and systems of objects. In Proceedings of TAPSOFT'95, pages 217–231. Springer, 1995.
N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.
R. Milner. A Calculus of Communicating Systems. Springer, 1980.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer, 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts 1 and 2. Information and Computation, 100:1–77, 1992.
R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114:149–171, 1993.
U. Nestmann. On determinacy and nondeterminacy in concurrent programming. PhD thesis, University of Erlangen, 1996.
A. Philippou. Reasoning about systems with evolving structure. PhD thesis, University of Warwick, 1996.
A. Philippou and D. Walker. On sharing and determinacy in concurrent systems. In Proceedings of CONCUR'95, pages 456–470. Springer, 1995.
A. Philippou and D. Walker. On transformations of concurrent object programs. In Proceedings of CONCUR'96, pages 131–146. Springer, 1996.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Proceedings of LICS'93, pages 376–385. Computer Society Press, 1993.
B. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. In Proceedings of POPL'97, to appear.
B. Pierce and D. Turner. Pict language definition, 1996.
M. Sanderson. Proof techniques for CCS. PhD thesis, University of Edinburgh, 1982.
D. Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms. PhD thesis, University of Edinburgh, 1992.
D. Sangiorgi. The name discipline of receptiveness. Technical report, INRIA, to appear.
A. Segall. Distributed network protocols. IEEE Transactions on Information Theory, IT-29(2):319–340, 1983.
C. Tofts. Proof methods and pragmatics for parallel programming. PhD thesis, University of Edinburgh, 1990.
D. Turner. The polymorphic pi-calculus: theory and implementation. PhD thesis, University of Edinburgh, 1996.
F. Vaandrager. Verification of a distributed summation algorithm. In Proceedings of CONCUR'95, pages 190–203. Springer, 1995.
N. Yoshida. Graph types for monadic mobile processes. In Proceedings of FST/TCS'96, pages 371–386. Springer, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Philippou, A., Walker, D. (1997). On confluence in the π-calculus. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_188
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_188
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive