Toggle Main Menu Toggle Search

Open Access padlockePrints

A Note on the Well-Foundedness of Adequate Orders Used for Truncating Unfoldings

Lookup NU author(s): Dr Victor Khomenko

Downloads


Abstract

Petri net unfolding prefixes are an important technique for formal verification and synthesis. In this paper we show that the requirement that the adequate order used for truncating a Petri net unfolding must be well-founded is superfluous in many important cases, i.e. it logically follows from other requirements. We give a complete analysis when this is the case. These results concern the very `core' of the unfolding theory.


Publication metadata

Author(s): Chatain T, Khomenko V

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2007

Pages: 11

Print publication date: 01/01/2007

Source Publication Date: January 2007

Report Number: 998

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/998.pdf


Share