Skip to main content
SpringerLink
Log in

Interaction diagrams

  • Conference paper
  • First Online:
A Decade of Concurrency Reflections and Perspectives (REX 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 803))

Abstract

Interaction diagrams are graphic representations of concurrent processes with evolving access capabilities; in particular they illustrate the points of access and relations between them. The basic step of computation is the migration of an access point between processes. This paper explains interaction diagrams through a sequence of examples. Diagrams can be regarded as graphic counterparts of terms in the π-calculus and illuminate some interesting points on its construction.

Work partly supported by Esprit Basic Research Project 6454 Confer.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Milner. The polyadic π-calculus: a tutorial. Research Report ECS-LFCS-91-80, Department of Computer Science, University of Edinburgh 1991. (To appear in the Proceedings of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, August 1991.)

    Google Scholar 

  2. R. Milner. Functions as Processes. J. of Mathem. Structures in Computer Science 2(2):119–141 (1992).

    Google Scholar 

  3. R. Milner. Action structures for the π-calculus. Research Report ECS-LFCS-93-264, Department of Computer Science, University of Edinburgh 1993.

    Google Scholar 

  4. R. Milner. Notes on actions I: π-nets with boxes and replication. Edinburgh, June 1993.

    Google Scholar 

  5. R. Milner, J. Parrow and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation 100:1–77 (1992).

    Google Scholar 

  6. W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag 1983.

    Google Scholar 

  7. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, ECS-LFCS-93-266, Department of Computer Science, University of Edinburgh, 1993.

    Google Scholar 

  8. D. Walker. π-calculus semantics of object-oriented programming languages. Proceedings of the Conference on Theoretical Aspects of Computer Software, Tohuku University, Japan, September 1991. Springer Verlang LNCS 526 pp 532–547, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swedish Institute of Computer Science, Box 1263, S-16428, Kista, Sweden

    Joachim Parrow

  2. Royal Institute of Technology, Stockholm, Sweden

    Joachim Parrow

  3. Uppsala University, Sweden

    Joachim Parrow

Authors
  1. Joachim Parrow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parrow, J. (1994). Interaction diagrams. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) A Decade of Concurrency Reflections and Perspectives. REX 1993. Lecture Notes in Computer Science, vol 803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58043-3_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-58043-3_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58043-0

  • Online ISBN: 978-3-540-48423-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation