A Translation of the Pi-Calculus Into MONSTR

Richard Banach (Computer Science Dept., Manchester University, UK)

J. Balázs (Computer Science Dept., P. J. Safárik University, Slovakia)

George A. Papadopoulos (Computer Science Dept., University of Cyprus, Cyprus)

Abstract: A translation of the pi-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the pi-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation formalism, both because the necessity to use delicate notions of bound variables and of scopes is avoided, and also because the standard model of graphs in set theory automatically yields a useful semantics for the process calculus. The correctness proof illustrates many features typically encountered in reasoning about graph rewriting systems, and particularly how serialisation techniques can be used to reorder an arbitrary execution into one having stated desirable properties.

Keywords: Concurrency, MONSTR, Pi-Calculus, Process Networks, Serialisability., Simulation, Term Graph Rewriting

Categories: D.1.3, D.3.1, F.3.2, F.4.2