Abstract
The theory of graph grammars is concerned with the rule-based transformation of graphs and graph-like structures. As the formalism of Petri nets is founded on a particular type of graphs, the various net refinement methods proposed for their structured design are in particular graph transformations. This paper aims at applying a recently developed technique for graph rewriting, the so-called pullback approach, to describe net refinement. The translation of this technique, which is based on (hyper)graph morphisms, into terms of net morphisms yields a well-defined mechanism closely related to pullback rewriting in hypergraphs. A variant allows to elegantly characterize a particular net refinement operation which modifies the context of the refined transition.
Supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the University of Bordeaux I.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Michel Bauderon. A uniform approach to graph rewriting: the pullback approach. In Graph-Theoretic Concepts in Computer Science, volume 1017 of Lecture Notes in Computer Science, 101–115, 1995.
Michel Bauderon. Parallel rewriting of graphs through the pullback approach. In Proc. SEGRAGRA'95, volume 2 of Electronic Notes in Theoretical Computer Science, 8 pages, 1995.
Wilfried Brauer, Robert Gold, and Walter Vogler. A survey of behaviour and equivalence preserving refinements of Petri nets. In Advances in Petri Nets, volume 483 of Lecture Notes in Computer Science, 1–46, 1991.
Michel Bauderon and Héléne Jacquet. Node rewriting in hypergraphs. In Graph-Theoretic Concepts in Computer Science, volume 1197 of Lecture Notes in Computer Science, 31–43, 1997.
Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218–270, 1993.
Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, 1–69, 1979.
Anja Gronewold and Hans Fleischhack. Computing Petri net languages by reductions. In Fundamentals of Computation Theory, volume 965 of Lecture Notes in Computer Science, 253–262, 1995.
Rob van Glabbeek and Ursula Goltz. Refinement of actions in causality based models. In Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, 267–300, 1990.
Annegret Habel. Hypergraph grammars: Transformational and algorithmic aspects. Journal of Information Processing and Cybernetics EIK, 28:241–277, 1992.
Annegret Habel and Hans-Jörg Kreowski. Characteristics of graph languages generated by edge replacement. Theoretical Computer Science, 51:81–115, 1987.
Annegret Habel and Hans-Jörg Kreowski. May we introduce to you: Hyperedge replacement. In Graph Grammars and Their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, 15–26, 1987.
Horst Herrlich and George E. Strecker. Category Theory. Sigma Series in Pure Mathematics. Heldermann Verlag, Berlin, 2nd edition, 1979.
Renate Klempien-Hinrichs. Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence. In Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, 397–411, 1996.
Julia Padberg, Hartmut Ehrig, and Leila Ribeiro. Algebraic high-level net transformation systems. Math. Struct. in Comp. Science, 5:217–256, 1995.
Julia Padberg, Magdalena Gajewsky, and Claudia Ermel. Rule-based refinement of high-level nets preserving safety properties. To appear in Proc. FASE, Lecture Notes in Computer Science, 1998.
Wolfgang Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin Heidelberg, 1985.
Grzegorz Rozenberg, ed. Handbook of Graph Transformations, volume I: Foundations. World Scientific, Singapore, 1997.
Walter Vogler. Behaviour preserving refinements of Petri nets. In Graph-Theoretic Concepts in Computer Science, volume 246 of Lecture Notes in Computer Science, 82–93, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klempien-Hinrichs, R. (1998). Net refinement by pullback rewriting. In: Nivat, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1998. Lecture Notes in Computer Science, vol 1378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053550
Download citation
DOI: https://doi.org/10.1007/BFb0053550
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64300-5
Online ISBN: 978-3-540-69720-6
eBook Packages: Springer Book Archive