Abstract
This paper is an attempt to integrate the algebra of communicating processes (ACP) and the algebra of flownomials (AF). Basically, this means to combine axiomatized parallel and looping operators. To this end we introduce a model of process graphs with multiple entries and exits. In this model the usual operations of both algebras are defined, e.g. alternative composition (this covers both the sum of ACP and the disjoint sum of AF), sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations of process graphs modulo isomorphism and modulo bisimulation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.C.M. Baeten and J.A. Bergstra. Graph isomorphism models for noninterleaving process algebra. In: Proceedings of ACP94 (Eds. A. Ponse, C. Verhoef and S.F.M. van Vlijmen), 299–318. Workshops in Computing, Springer-Verlag, 1995.
J.C.M. Baeten, J.A. Bergstra and Gh. Stefanescu. Process algebra with feedback. In: Proceedings of the workshop: Three Days of Bisimulation (Eds. A. Ponse, M. de Rijke and Y. Venema). To appear as: CSLI volume, Stanford, 1995.
J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.
J.A. Bergstra, I. Bethke and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37:243–258, 1994.
J.A. Bergstra and J.W. Klop. Proces algebra for synchronous communication. Information and Control, 60:109–137, 1984.
J.A. Bergstra and Gh. Stefanescu. Bisimulation is two-way simulation. Information Processing Letters, 52:285–287, 1994.
S.L. Bloom and Z. Esik. Iteration theories: the equational logic of iterative processes. EATCS Monographs in Theoretical Compputer Science, Springer Verlag, 1993.
V.E. Cazanescu and Gh. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171–210, 1990.
C.C. Elgot. Manadic computation and iterative algebraic theories. In Proceedings Logic Colloquium'73, pages 175–230, North-Holland, 1975. Studies in Logic and the Foundations of Mathematics, Volume 80.
S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3–41. Princeton University Press, 1956.
R. Milner. Flowgraphs and flow algebra. Journal of the Association for Computing Machinery, 26:794–818, 1979.
R. Milner. A calculus of communicating systems. LNCS 92, Springer, 1980.
D. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, 167–183. LNCS 104, Springer Verlag, 1981.
J. Parrow. Structural and behavioural equivalence of networks. Information and Computation, 107:58–90, 1993.
Gh. Stefanescu. On flowchart theories. Part I: The deterministic case. Journal of Computer and System Sciences, 35:163–191, 1987.
Gh. Stefanescu. Feedback theories (a calculus for isomorphism classes of flowchart schemes). INCREST Preprint No. 24, Bucharest, April 1986. Also in: Revue Roumaine de Mathematiques Pures et Applique, 35:73–79, 1990.
Gh. Stefanescu. Algebra of Flownomials. Part 1: Binary flownomials; Basic Theory. Report TUM-I9437, Technical University Munich, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J.A., Ştefaonescu, G. (1995). Processes with multiple entries and exits. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-60249-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60249-1
Online ISBN: 978-3-540-44770-2
eBook Packages: Springer Book Archive