Abstract
The main aim of this paper is to analyze the similarities and differences between graph grammars and Petri nets. Particularly we compare the high-level versions of nets and grammars, namely AHL nets and attributed graph grammars and the corresponding flattening constructions to PT nets and labeled graph grammars, and show that these flattenings are compatible (syntactically and semantically) with the translations of nets to grammars. Thus Petri nets are equivalent to their graph grammar translations. Due to the fact that graphs correspond to sets of tokens, Petri nets can syntactically be considered as special (simple) graph grammars. In their basic semantics however this is not precisely true: tokens without individuality are in contrast to corresponding vertices showing individuality. (Reachability and derivation) Trees have been chosen as a common semantical domain.
This paper was partially supported by a CNPq-grant for Leila Ribeiro and by the ESPRIT Basic Research working group # 7183 “Computing by Graph Transformation (COMPUGRAPH II)”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi, An event structure semantics for safe graph grammars, To appear in Proc. of the IFIP Working Conference PROCOMET'94, 1994.
H. Ehrig, M. Baldamus, and F. Orejas, New concepts for amalgamation and extension in the framework of specification logics, Proc. ADT-Workshop Durdan (Durdan), 1991, LNCS 655, pp. 199–221.
H. Ehrig, M. Größe-Rhode, and A. Heise, Specification techniques for concurrent and distributed systems, Tech. Report 92/5, Technical University of Berlin, jan. 1992, Invited paper for 2nd Maghr. Conference on Software Engineering and Artificial Intelligence, Tunis, 1992.
H. Ehrig, M. Korff, and M. Löwe, Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts, 4th Int. Workshop on Graph Grammars and their Application to Computer Science, Springer, 1991, LNCS 532, pp. 24–37.
H. Ehrig and B. Mahr, Fundamentals of algebraic specifications 1: Equations and initial semantics, EACTS Monographs on Theoretical Computer Science, vol. 6, Springer, Berlin, 1985.
H. Ehrig, J. Padberg, and L. Ribeiro, Algebraic high-level nets: Petri nets revisited, Recent Trends in Data Type Specification (Caldes de Malavella, Spain), Springer, 1994, LNCS 785, pp. 188–206.
H.J. Genrich and K. Lautenbach, System modelling with high-level Petri nets, TCS 13 (1981), 109–136.
K. Jensen, Coloured Petri nets. basic concepts, analysis methods and practical use, Springer, Berlin, 1992.
K. Jensen and G. Rozenberg (eds.), High-level Petri nets: theory and application, Springer, 1991.
H.-J. Kreowski, A comparison between Petri nets and graph grammars, Springer, 1981, LNCS 100, pp. 306–317
M. Löwe, M. Korff, and A. Wagner, An algebraic framework for the transformation of attributed graphs, Term Graph Rewriting: Theory and Practice, John Wiley & Sons Ltd, 1993, pp. 185–199.
M. Löwe, Algebraic approach to single-pushout graph transformation, TCS 109 (1993), 181–224.
J. Meseguer and U. Montanari, Petri nets are monoids, Information and Computation 88 (1990), no. 2, 105–155.
J. Meseguer, U. Montanari, and V. Sassone, On the model of computation of place/transition Petri nets, ATPN'94, Springer, 1994, LNCS 815, pp. 16–38.
J. Padberg, H. Ehrig, and L. Ribeiro, Algebraic high-level net transformation systems, Tech. Report 93-12, Technical University of Berlin, 1993, Revised Verion accepted for Mathematical Structures in Computer Science.
W. Reisig, A graph grammar representation of nonsequential processes, Springer, 1981, LNCS 100, pp. 318–325
W. Reisig, Petri nets, Springer, 1985.
W. Reisig, Petri nets and algebraic specifications, TCS 80 (1991), 1–34.
L. Ribeiro and J. Padberg, Algebraic high-level nets and transformations with initial markings, Tech. Report 94/7, Technical University of Berlin, 1994.
H.-J. Schneider, On categorical graph grammars integrating structural transformations and operations on labels. TCS 109 (1993), pp. 257–274.
H.-J. Schneider, Graph grammars as a tool to define the behaviour of process systems: from Petri nets to Linda. In Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, 1994.
J.C. Wileden, Relationships between graph grammars and the design and analysis of concurrent software, Springer, 1979, LNCS 73, pp 456–463.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korff, M., Ribeiro, L. (1996). Formal relationship between graph grammars and Petri nets. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_94
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive