ePrints

A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes

Lookup NU author(s): Dr Victor Khomenko

Downloads

• Accepted version [.pdf]

Abstract

In this paper, a new kind of behaviour-preserving transition insertions in Petri nets is proposed, and a method for computing the useful and valid transition 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) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.

Publication metadata

Author(s): Khomenko V

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2010

Pages: 18

Print publication date: 01/02/2010

Source Publication Date: February 2010

Report Number: 1189

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/1189.pdf

Share