Abstract
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.
This research was completed while the second author was visited the Programming Research Group of the University of Amsterdam.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77–121, 1985.
J.A. Bergstra, J.W. Klop, and E.R. Olderog. Readies and failures in the algebra of communicating processes. SIAM Journal of Computing, 17:1134–1177, 1988.
S.L. Bloom, Z. Esik, and D. Taubner. Iteration theory of synchronization trees. Information and Computation, 103:1–55, 1993.
B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95–169, 1983.
V.E. Cazanescu and Gh. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171–210, 1990.
V.E. Cazanescu and Gh. Stefanescu. Classes of finite relations as initial abstract data types I. Discrete Mathematics, 90:233–265, 1991.
V.E. Cazanescu and Gh. Stefňescu. A general result of abstarct flowchart schemes with applications to the study of accessibility, reduction and minimization. Theoretical Computer Science, 99:1–63, 1992. (Fundamental Study).
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.
C.C. Elgot. Finite automata from the a flowchart schemes point of view. In Proceedings MFCS'77. Springer, 1977. Lecture Notes in Computer Science.
C.C. Elgot. Some geometrical categories associated with flowchart schemes. In Proceedings FCT'77, pages 256–259. Springer, 1977. Lecture Notes in Computer Science.
C.C. Elgot, S.L. Bloom, and R. Tindell. On the algebraic structure of rooted trees. Journal of Computer and System Sciences, 16:362–399, 1978.
R. Milner. A calculus of communicating systems. Springer, 1980.
R. Milner. Communication and concurrency. Prentice Hall International, 1989.
Gh. Stefanescu. On flowchart theories I: The determinisitc case. Journal of Computer and System Sciences, 35:163–191, 1987.
Gh. Stefanescu. On flowchart theories II: The nondeterministic case. Theoretical Computer Science, 52:307–340, 1987.
Gh. Stefanescu. Determinism and nondeterminism in program scheme theory: algebraic aspects. PhD thesis, University of Bucharest, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J.A., Ştefanescu, G. (1993). Translations between flowchart schemes and process graphs. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive