Toggle Main Menu Toggle Search

Open Access padlockePrints

Branching processes of high-level Petri nets

Lookup NU author(s): Dr Victor Khomenko, Professor Maciej Koutny

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

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.


Publication metadata

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

Pages: 458-472

ISSN: 0302-9743 (print) 1611-3349 (online)

Publisher: Springer

URL: http://dx.doi.org/10.1007/3-540-36577-X_34

DOI: 10.1007/3-540-36577-X_34

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540008989


Actions

Find at Newcastle University icon    Link to this publication


Share