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

DOI10.1016/j.ipl.2007.06.002zbMath1184.68344OpenAlexW2013854757MaRDI QIDQ2380011

Victor Khomenko, Thomas Chatain

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.06.002

zbMATH Keywords

Petri netconcurrencyadequate orderunfolding prefixwell-foundedness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Symbolic unfolding of parametric stopwatch Petri nets ⋮ Directed Unfolding of Petri Nets ⋮ Unnamed Item

Cites Work

• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• An intuitionistic proof of Kruskal's theorem
• Canonical prefixes of Petri net unfoldings
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: On the well-foundedness of adequate orders used for construction of complete unfolding prefixes