Browse by author
Lookup NU author(s): Dr Victor Khomenko, Professor Maciej KoutnyORCiD
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 in the sense that all the verification tools employing the traditional unfoldings can be reused with prefixes derived directly from high-level nets. Our experiments demonstrate that this method is often superior to the usual one, involving the explicit construction of the intermediate low-level net.
Author(s): Khomenko V, Koutny M
Publication type: Report
Publication status: Published
Series Title: Department of Computing Science Technical Report Series
Year: 2002
Pages: 18
Report Number: 763
Institution: Department of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/763.pdf
