Graph grammars and Petri net transformations

53Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this paper is a tutorial introduction to graph grammars and graph transformations on one hand and to Petri net transformations on the other hand. In addition to an introduction to both areas the paper shows how they have influenced each other. The concurrency concepts and semantics of graph transformations have been generalized from those of Petri net using the fact that the token game of Petri nets can be considered as a graph transformation step on discrete graphs. On the other hand each Petri net can be considered as a graph, such that graph transformations can be used to change the net structure of Petri nets. This leads to a rule based approach for the development of Petri nets, where the nets in different development stages are related by Petri net transformations. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Ehrig, H., & Padberg, J. (2004). Graph grammars and Petri net transformations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3098, 496–536. https://doi.org/10.1007/978-3-540-27755-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free