Toggle Main Menu Toggle Search

Open Access padlockePrints

Behaviour-Preserving Transition Insertions in Unfolding Prefixes

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.


Some design methods based on Petri nets modify the original specification by behaviour-preserving insertion of new transitions. If the unfolding prefix is used to analyse the net, it has to be re-unfolded after each modification, which is detrimental for the overall performance. The approach presented in this paper applies the transformations directly to the unfolding prefix, thus avoiding re-unfolding. This also helps in visualisation, since the application of a transformation directly to the prefix changes it in a way that was `intuitively expected' by the user, while re-unfolding can dramatically change the shape of the prefix. Moreover, rigourous validity checks for several kinds of transition insertions are developed. These checks are performed on the original unfolding prefix, so one never has to backtrack due to the choice of a transformation which does not preserve the behaviour.

Publication metadata

Author(s): Khomenko V

Editor(s): Kleijn, J., Yakovlev, A.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 28th International Conference on Petri Nets and Other Models of Concurrency (ICATPN)

Year of Conference: 2007

Pages: 204-222

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer


DOI: 10.1007/978-3-540-73094-1_14

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540730934


Link to this publication