Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation

This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of owno-mials (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 dened, e.g. The main results consist of correct and complete axiomatisations for process graphs modulo isomorphism and mod-ulo bisimulation.

[1]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[2]  M. Arbib,et al.  Partially additive categories and flow-diagram semantics☆ , 1980 .

[3]  Gheorghe Stefanescu,et al.  On Flowchart Theories. I. The Deterministic Case , 1987, J. Comput. Syst. Sci..

[4]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[5]  Jan A. Bergstra,et al.  Network algebra for synchronous and asynchronous dataflow , 1994 .

[6]  Jan A. Bergstra,et al.  Translations Between Flowchart Schemes and Process Graphs , 1993, FCT.

[7]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[8]  Joseph A. Goguen,et al.  On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs , 1974, J. Comput. Syst. Sci..

[9]  Z. Ésik,et al.  Iteration Theories: The Equational Logic of Iterative Processes , 1993 .

[10]  Robin Milner,et al.  Flowgraphs and Flow Algebras , 1979, JACM.

[11]  Jan A. Bergstra,et al.  Bisimulation is Two-Way Simulation , 1994, Inf. Process. Lett..

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[13]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[14]  Jan A. Bergstra,et al.  Graph isomorphism models for non interleaving process algebra , 1994 .

[15]  Gheorghe Stefanescu,et al.  Towards a new algebraic foundation of flowchart scheme theory , 1990 .

[16]  Jan A. Bergstra,et al.  Processes with Multiple Entries and Exits , 1995, FCT.

[17]  Jan A. Bergstra,et al.  Process algebra with feedback , 1994 .

[18]  Joachim Parrow.  Structural and Behavioural Equivalences of Networks , 1990, ICALP.

[19]  Calvin C. Elgot,et al.  Some "Geometrical" Categories Associated with Flowchart Schemes , 1977, FCT.

[20]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[21]  Zoltán Ésik,et al.  Iteration Theories of Synchronization Trees , 1993, Inf. Comput..