ePrints

On the well-foundedness of adequate orders used for construction of complete unfolding prefixes

Lookup NU author(s): Dr Victor Khomenko

Downloads

• Accepted version [.pdf]

Abstract

Petri net unfolding prefixes are an important technique for formal verification and synthesis of concurrent systems. 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. © 2007 Elsevier B.V. All rights reserved.

Publication metadata

Author(s): Chatain T, Khomenko V

Publication type: Article

Publication status: Published

Journal: Information Processing Letters

Year: 2007

Volume: 104

Issue: 4

Pages: 129-136

Date deposited: 08/03/2011

ISSN (print): 0020-0190

ISSN (electronic): 1872-6119

Publisher: Elsevier

URL: http://dx.doi.org/10.1016/j.ipl.2007.06.002

DOI: 10.1016/j.ipl.2007.06.002

Altmetrics

Share