Article thumbnail

A Translation of the Pi-Calculus into MONSTR

By R. Banach, J. Balázs and G. Papadopoulos

Abstract

A translation of the π-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 π-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

Topics: Key Words, Concurrency, Pi-Calculus, Term Graph Rewriting, MONSTR, Process Networks, Simulation, Serialisability. Category, D.1.3, D.3.1, F.3.2, F.4.2
Year: 1995
OAI identifier: oai:CiteSeerX.psu:10.1.1.160.49
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.man.ac.uk/~banac... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.