Abstract
We introduce a generic type system (based on Milner’s sort system) for the synchronous polyadic π-calculus, allowing us to mechanise the analysis of input/output capabilities of mobile processes. The parameter of the generic type system is a lattice-ordered monoid, the elements of which are used to describe the capabilities of channels with respect to their input/output-capabilities. The type system can be instantiated in order to check process properties such as upper and lower bounds on the number of active channels, confluence and absence of blocked processes.
Research supported by SFB 342 (subproject A3) of the DFG.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Martín Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software, pages 611–638. Springer-Verlag, 1997.
Gérard Berry and Gérard Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
G. Birkhoff. Lattice Theory. American Mathematical Society, third edition, 1967.
Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Control flow analysis for the pi-calculus. In Proc. of CONCUR’ 98, pages 84–98. Springer-Verlag, 1998. LNCS 1466.
Simon J. Gay. A sort inference algorithm for the polyadic π-calculus. In Proc. of POPL’ 93. ACM, 1993.
Kohei Honda. Composing processes. In Proc. of POPL’96, pages 344–357. ACM, 1996.
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proc. ofLICS’ 97, pages 128–139. IEEE, Computer Society Press, 1997.
Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Proc. of POPL’96, pages 358–371. ACM, 1996.
Barbara König. Description and Verification of Mobile Processes with Graph Rewriting Techniques. PhD thesis, Technische Universität München, 1999.
Barbara König. Generating type systems for process graphs. In Proc. of CONCUR’ 99, pages 352–367. Springer-Verlag, 1999. LNCS 1664.
Barbara K’onig. Analysing input/output-capabilities of mobile processes with a generic type system (extended version). Technical Report TUM-I0009, Technische Universit’at München, 2000.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100(1): 1–77, 1992.
Robin Milner. The polyadic π-calculus: a tutorial. In F. L. Hamer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, Heidelberg, 1993.
Uwe Nestmann and Martin Steffen. Typing confluence. In Second International ERCIM Workshop on Formal Methods in Industrial Critical Systems (Cesena, Italy, July 4–5, 1997), pages 77–101, 1997.
Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Proc. ofLICS’ 93, pages 376–385, 1993.
James Riely and Matthew Hennessy. Distributed processes and location failures. In Proc. of ICALP’97, pages 471–481. Springer-Verlag, 1997. LNCS 1256.
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
König, B. (2000). Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_34
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive