Lookup NU author(s): Dr Victor Khomenko,
Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper, we define branching processes and unfoldings of high-level Petri nets and propose an algorithm which builds finite and complete prefixes of such unfoldings. The advantage of our method is that it avoids a potentially expensive translation of a high-level Petri net into a low-level one. The approach is conservative as all the verification tools employing the traditional unfoldings can be reused with prefixes derived directly from high-level nets. We show that this is often better than the usual explicit construction of the intermediate low-level net.
Author(s): Khomenko V, Koutny M
Editor(s): Garavel, H., Hatcliff, J.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Tools and Algorithms for the Construction and Analysis of Systems: 9th International Conference (TACAS)
Year of Conference: 2003
ISSN: 0302-9743 (print) 1611-3349 (online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science