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 pi-calculus and illuminate some interesting points on its construction.
Categories and Subject Descriptors: F.1.1 [Computation by Abstract Devices]: Models of Computation; F.1.2 [Computation by Abstract Devices]: Modes of Computation; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs
Additional Key Words and Phrases: concurrency, graphic representation, pi-calculus, access migration
- Simon J. Gay. A sort inference algorithm for the polyadic pi-calculus. In Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 429-438, Charleston, South Carolina, January 1993.
- Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41-77, September 1992.
- D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, April 1990.