Translations between flowchart schemes and process graphs
In a flowchart scheme an atomic action is modelled as a vertex (box), while in a process graph an atomic action is modelled as an edge. We define translations between these two graphical representations. By using these translations, we show that the classical bisimulation equivalence on process graphs coincides with the natural extension of the classical step-bystep flowchart equivalence to the nondeterministic case. This result allows us to translate axiomatisation results from flowcharts to processes and viceversa.
KeywordsNormal Form Monoidal Category Atomic Action Computation Sequence Iteration Theory
Unable to display preview. Download preview PDF.
- 1.J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.Google Scholar
- 9.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.C.C. Elgot. Finite automata from the a flowchart schemes point of view. In Proceedings MFCS'77. Springer, 1977. Lecture Notes in Computer Science.Google Scholar
- 11.C.C. Elgot. Some geometrical categories associated with flowchart schemes. In Proceedings FCT'77, pages 256–259. Springer, 1977. Lecture Notes in Computer Science.Google Scholar
- 13.R. Milner. A calculus of communicating systems. Springer, 1980.Google Scholar
- 14.R. Milner. Communication and concurrency. Prentice Hall International, 1989.Google Scholar
- 17.Gh. Stefanescu. Determinism and nondeterminism in program scheme theory: algebraic aspects. PhD thesis, University of Bucharest, 1991.Google Scholar