Processes with multiple entries and exits

  • J. A. Bergstra
  • Gh. Ştefaonescu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 965)


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.

Key words & Phrases

process algebra feedback flowchart theories 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BaB95]
    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.Google Scholar
  2. [BaBS95]
    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.Google Scholar
  3. [BaW90]
    J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.Google Scholar
  4. [BeBP94]
    J.A. Bergstra, I. Bethke and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37:243–258, 1994.Google Scholar
  5. [BeK84]
    J.A. Bergstra and J.W. Klop. Proces algebra for synchronous communication. Information and Control, 60:109–137, 1984.CrossRefGoogle Scholar
  6. [BeS94]
    J.A. Bergstra and Gh. Stefanescu. Bisimulation is two-way simulation. Information Processing Letters, 52:285–287, 1994.Google Scholar
  7. [BlE93]
    S.L. Bloom and Z. Esik. Iteration theories: the equational logic of iterative processes. EATCS Monographs in Theoretical Compputer Science, Springer Verlag, 1993.Google Scholar
  8. [CaS90]
    V.E. Cazanescu and Gh. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171–210, 1990.MathSciNetGoogle Scholar
  9. [Elg75]
    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.Google Scholar
  10. [Kle56]
    S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3–41. Princeton University Press, 1956.Google Scholar
  11. [Mil79]
    R. Milner. Flowgraphs and flow algebra. Journal of the Association for Computing Machinery, 26:794–818, 1979.Google Scholar
  12. [Mil80]
    R. Milner. A calculus of communicating systems. LNCS 92, Springer, 1980.Google Scholar
  13. [Pa81]
    D. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, 167–183. LNCS 104, Springer Verlag, 1981.Google Scholar
  14. [Par93]
    J. Parrow. Structural and behavioural equivalence of networks. Information and Computation, 107:58–90, 1993.Google Scholar
  15. [Ste87]
    Gh. Stefanescu. On flowchart theories. Part I: The deterministic case. Journal of Computer and System Sciences, 35:163–191, 1987.CrossRefGoogle Scholar
  16. [Ste86]
    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.Google Scholar
  17. [Ste94]
    Gh. Stefanescu. Algebra of Flownomials. Part 1: Binary flownomials; Basic Theory. Report TUM-I9437, Technical University Munich, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • J. A. Bergstra
    • 1
    • 2
  • Gh. Ştefaonescu
    • 3
  1. 1.Programming Research GroupUniversity of AmsterdamSJ AmsterdamThe Netherlands
  2. 2.Department of PhilosophyUtrecht UniversityCS UtrechtThe Netherlands
  3. 3.Institute of Mathematics of the Romanian AcademyBucharestRomania

Personalised recommendations