PROCESSES WITH MULTIPLE ENTRIES AND EXITS MODULO ISOMORPHISM AND MODULO BISIMULATION

Authors:
J.A. Bergstra;Gh. Ş/tefă/nescu
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 Netherl ...;Department of the Fundamentals of Computer Science, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania. E-mail: ghstef@imar.ro
Venue:
Fundamenta Informaticae
Year:
1996

Citing 13
Cited 0

On flowchart theories. Part I. The deterministic case

Journal of Computer and System Sciences
Towards a new algebraic foundation of flowchart scheme theory

Fundamenta Informaticae
Process algebra

Process algebra
Iteration theories of synchronization trees

Information and Computation
Iteration theories: the equational logic of iterative processes

Iteration theories: the equational logic of iterative processes
Structural and behavioral equivalences of networks

Information and Computation
Bisimulation is two-way simulation

Information Processing Letters
Flowgraphs and Flow Algebras

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Translations Between Flowchart Schemes and Process Graphs

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Processes with Multiple Entries and Exits

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
On homomorphisms, correctness, termination, unfoldments, equivalence of flow diagram programs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.