Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
A new kind of behaviour-preserving insertions of new transitions in Petri nets is proposed, and a method for computing such insertions using a complete unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) reunfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.
Author(s): Khomenko V
Editor(s): Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 5th International Conference on Graph Transformation (ICGT)
Year of Conference: 2010
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer Verlag
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science