Abstract
The π-calculus is the paradigmatic calculus for process mobility. Its theory has been studied in depth [8,12]. Relevant parts of it are the algebraic theory and the type systems. Most of the algebraic theory has been developed on the untyped calculus; the results include proof systems or axiomatisations that are sound and complete on finite processes for the main behavioral equivalences: late and early bisimilarity, late and early congruence [9,6,7], open bisimilarity [11], testing equivalence [1]. Much of the research on types has focused on their behavioral effects. For instance, modifications of the standard behavioral equivalences have been proposed so as to take types into account [10,12].
Work supported by EU project PROFUNDIS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boreale, M., De Nicola, R.: Testing equivalences for mobile processes. Journal of Information and Computation 120, 279–303 (1995)
Boreale, M., Sangiorgi, D.: Bisimulation in name-passing calculi without matching. In: Proceedings of LICS 1998, July 1998, IEEE Computer Society Press, Los Alamitos (1998)
Deng, Y., Sangiorgi, D.: Towards an algebraic theory of typed mobile processes (full version), http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/mypapers.html
Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping (2003); To appear in Mathematical Structures in Computer Science
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. In: Nestmann, U., Pierce, B.C. (eds.) Proceedings of HLCL 1998. ENTCS, vol. 16.3, pp. 3–17. Elsevier Science Publishers, Amsterdam (1998)
Lin, H.: Symbolic bisimulation and proof systems for the π-calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, UK (1994)
Lin, H.: Complete inference systems for weak bisimulation equivalences in the π- calculus. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 187–201. Springer, Heidelberg (1995)
Milner, R.: Communicating and Mobile Systems: the π-Calculus, May 1999. Cambridge University Press, Cambridge (1999)
Parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Journal of Information and Computation 120(2), 174–197 (1995)
Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6(5), 409–454 (1996)
Sangiorgi, D.: A theory of bisimulation for the π-calculus. Acta Informatica 33, 69–97 (1996)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, Y., Sangiorgi, D. (2004). Towards an Algebraic Theory of Typed Mobile Processes. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive