Abstract
A graph grammar is constructed from a given Petri-net so that direct derivation steps in the grammar correspond to firings of transitions in the net. This close relationship between Petri-nets and graph grammars allows to compare the concurrency concepts of the two theories. As an illustrating example the well-known dining-philosophers problem is discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Brauer (ed.): Net Theory and Applications, Proc. of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979, Lect. Notes in Comp. Science 84, Heidelberg 1980
V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph Grammars and Their Application to Computer Science and Biology, Proc. Int. Workshop in Bad Honnef, 1978, Lect. Not. in Comp. Sci. 73, 1979
E.W. Dijkstra: Hierarchical Ordering of Sequential Processes, Acta Informatica 1, pp. 115–138 (1971)
H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars (a Survey), in: /CER 78/, pp. 1–69
H. Ehrig, H.-J. Kreowski: Categorical Approach to Graphical Systems and Graph-Grammars, Proc. Int. Symp. Algebraic System Theory, Udine 1975, Lect. Not. Econ. Math. Syst. 131, pp. 323–351 (1976)
—: Parallelism of Manipulations in Multidemensional Information Structures, Proc. MFCS, Gdansk 1976, Lect. Not. Comp. Sci. 45, pp. 284–293 (1976)
—: Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems, to appear in Information Systems
H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B.K. Rosen, J. Winkowski: Transformations of Structures: an Algebraic Approach, IBM Research Report RC 7998, Yorktown Heights, 1979
H. Ehrig, B.K. Rosen: The Mathematics of Record Handling, Lect. Not. Comp. Sci. 52, pp. 206–220 (1977)
—: Decomposition of Graph Grammar Productions and Derivations, in: /CER 78/, pp. 192–205
H.-J. Kreowski: Manipulationen von Graphmanipulationen, Dissertation, FB 20 (Informatik), TU Berlin, 1977
H.-J. Kreowski: Anwendungen der Algebraischen Theorie von Graph-Grammatiken auf Konsistenz und Synchronisation in Datenbanksystemen, Techn. Report 78-15, FB Informatik, TU Berlin, 1978
K. Lautenbach: Liveness in Petri-Nets, Internal Report GMD 02.1/75-7-29, Bonn, 1975
M. Nagl: Graph-Grammatiken: Theorie, Anwendungen, Implementierung, Wiesbaden, Vieweg Verlag, 1979
H. Noltemeier: Graphentheoretische Modelle und Methoden, Proc. GI-Fachtagung Formale Modelle für Informationssysteme, Tutzing, 1979, Informatik-Fachbericht 21, pp. 170–180
C.A. Petri: General Net Theory, Proc. Joint IBM Univ. Newcastle upon Tyne, Seminar, B.Shaw (ed.), 1976
W. Reisig: A Grammar Representation of Nonsequential Processes, this volume
B.K. Rosen: A Church-Rosser Theorem for Graph Grammars, SIGACT News 7, 3, pp. 26–31 (1975)
G. Scheschonk: Zur Modellierung von Systemen auf der Basis der Nebenläufigkeit, Proc. GI-Fachtagung Formale Modelle für Informationssysteme, Tutzing, 1979, Informatik-Fachbericht 21, pp.236–245
J.C. Wileden: Relationship between Graph Grammars and the Design and Analysis of Concurrent Software, in /CER 78/, pp.456–463
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreowski, HJ. (1981). A comparison between petri-nets and graph grammars. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive