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

Authors:
Thomas Chatain;Victor Khomenko
Affiliations:
Department of Computer Science, Aalborg University, Aalborg, Denmark;School of Computing Science, Newcastle University, Newcastle upon Tyne, UK
Venue:
Information Processing Letters
Year:
2007

Citing 3
Cited 2

Branching processes of Petri nets

Acta Informatica
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification

Directed Unfolding of Petri Nets

Transactions on Petri Nets and Other Models of Concurrency I
Symbolic unfolding of parametric stopwatch Petri nets

Formal Methods in System Design

Quantified Score

Hi-index	0.89

Visualization

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.