PROCESSES WITH MULTIPLE ENTRIES AND EXITS MODULO ISOMORPHISM AND MODULO BISIMULATION

Article type: Research Article

Authors: Bergstra, J.A. | Ştefănescu, Gh.

Affiliations: Programming Research Group, University of Amsterdam, Kruislaan 403. 1098 SJ Amsterdam, The Netherlands; Department of Philosophy, Utrecht University, Heidelberglaan 8. 3584 CS Utrecht, The Netherlands. E-mail: janb@fwi.uva.nl | Department of the Fundamentals of Computer Science, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania. E-mail: ghstef@imar.ro

Abstract: This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of flownomials (AF). Basically, this means to combine axiomatisations of parallel and looping operators. To this end a model of process graphs with multiple entries and exits is introduced. In this model the usual operations of both algebras are defined, e.g. alternative composition, sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations for process graphs modulo isomorphism and modulo bisimulation.

DOI: 10.3233/FI-1996-27103

Journal: Fundamenta Informaticae, vol. 27, no. 1, pp. 37-56, 1996