Graph Grammars and Petri Net Transformations
Graph Grammars and Petri Net Transformations
复制标题
图文法和 Petri 网变换
DOI：
10.1007/978-3-540-27755-2_14
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
J. Padberg
中科院分区：
文献类型：
--
作者：
H. Ehrig;J. Padberg
本文的目的是一个教程介绍图形语法和图形转换一方面和Petri网转换另一方面。除了介绍这两个领域的文件显示了它们是如何相互影响的。利用Petri网的令牌博弈可以看作是离散图上的图变换步骤，从Petri网的并发概念和语义中推广了图变换的并发概念和语义。另一方面，每个Petri网可以被认为是一个图，这样，图变换可以用来改变Petri网的网络结构。这导致了一个基于规则的方法的发展的Petri网，在不同的发展阶段的网相关的Petri网变换。
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.