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


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… (More)


4 Figures and Tables