Abstract
This paper studies the relationship between synchronous and asynchronous mobile processes, in the setting of the π-calculus. A type system for processes of the asynchronous monadic subcalculus is introduced and used to obtain a full-abstraction result: two processes of the polyadic π-calculus are typed barbed congruent iff their translations into the subcalculus are asynchronous-monadic-typed barbed congruent.
This work was done while the author was at BRICS, Aarhus University, Denmark.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Boreale. On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science, 195(2):205–226, 1998.
G. Boudol. Asynchrony and the π-calculus (note). Rapports de Recherche 1702, INRIA Sophia Antipolis, 1992.
C. Fournet. The Join-Calculus: a Calculus for Distributed Mobile Programming. Thesis École Polytechnique 1998.
C. Fournet and G. Gonthier. The reflexive chemical machine and the joincalculus. In Proc. 23rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 372–385, 1996.
C. Fournet and L. Maranget. The join-calculus language. http://join.inria.fr.
K. Honda. Types for Dyadic Interaction. In Proc. CONCUR’93, 509–523. Springer 1993.
K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In P. America, editor, Proc. European Conference on Object-Oriented Programming, ECOOP’ 91. Springer 1991.
N. Kobayashi and B. Pierce and D. Turner. Linearity and the Pi-Calculus. In Proc. 23rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 358–371, 1996.
M. Merro and D. Sangiorgi. On asynchrony in name-passing calculi. In Proc. 25th International Colloquium ICALP’98. Springer 1998.
R. Milner. Communication and Concurrency. Prentice Hall 1989.
R. Milner. The Polyadic π-Calculus: a Tutorial. In Logic and Algebra of Specification, Springer 1992, 203–246.
R. Milner. Communicating and mobile systems: the π -calculus. CUP 1999.
R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation, 100(1):1–77, 1992.
U. Nestmann. What is a ‘Good’ Encoding of Guarded Choice? In Proc. EXPRESS’97, Electronic Lecture Notes in Computer Science, vol. 7, 1997.
U. Nestmann and B. Pierce. Decoding Choice Encodings. In Proc. International Conference on Concurrency Theory CONCUR’96, 179–194. Springer 1996.
C. Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus. In Proc. 24th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 256–265, 1997.
B. Pierce and D. Sangiorgi. Ty** and Subty** for Mobile Processes. Mathematical Structures in Computer Science 6(5), 409–454, 1996.
B. Pierce and D. Sangiorgi. Behavioral Equivalence in the Polymorphic Pi-Calculus. In Proc. 24th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 1997.
B. Pierce and D. Turner. Pict: A Programming Language Based on the Pi-Calculus. Indiana University technical report 1997.
P. Quaglia and D. Walker. On Encoding pπ in mπ. In Proc. 18th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS’ 98, 42–53. Springer, 1998.
D. Sangiorgi. The name discipline of uniform receptiveness. In Proc. 24th International Colloquium ICALP’97, 303–313. Springer 1997.
D. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh 1996.
N. Yoshida. Graph Types for Monadic Mobile Processes. In Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS’ 97, 371–386. Springer, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quaglia, P., Walker, D. (2000). On Synchronous and Asynchronous Mobile Processes. In: Tiuryn, J. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2000. Lecture Notes in Computer Science, vol 1784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46432-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-46432-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67257-9
Online ISBN: 978-3-540-46432-7
eBook Packages: Springer Book Archive