Goal-driven unfolding of Petri nets

DOI10.4230/LIPICS.CONCUR.2017.18MaRDI QIDQ5111631zbMATH OpenFDO

Authors Thomas Chatain, Loïc Paulevé

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1611.01296

zbMATH Keywords

reachabilityconcurrencymodel reductionPetri netsunfoldingsautomata networks

Mathematics Subject Classification ID

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

Recommendations

• Directed Unfolding of Petri Nets
• scientific article; zbMATH DE number 1863174
• Unfolding based alorithms for the reachability problem
• scientific article; zbMATH DE number 1670797
• A technique of state space search based on unfolding

Cites work

• scientific article; zbMATH DE number 1361116 (Why is no real title available?)
• scientific article; zbMATH DE number 1863175 (Why is no real title available?)
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Complexity results for 1-safe nets
• Directed Unfolding of Petri Nets
• Dynamic partial-order reduction for model checking software
• Efficient unfolding of contextual Petri nets
• Goal-oriented reduction of automata networks
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
• Peephole Partial Order Reduction
• Unfolding based alorithms for the reachability problem
• Unfoldings: A partial-order approach to model checking.

Cited in

(12)

• Canonical prefixes of Petri net unfoldings
• scientific article; zbMATH DE number 1722709 (Why is no real title available?)
• A technique of state space search based on unfolding
• A lazy query scheme for reachability analysis in Petri nets
• Avoid one's doom: finding cliff-edge configurations in Petri nets
• scientific article; zbMATH DE number 1863174 (Why is no real title available?)
• Concurrency in Boolean networks
• scientific article; zbMATH DE number 2080062 (Why is no real title available?)
• Static analysis and stochastic search for reachability problem
• Directed Unfolding of Petri Nets
• Unfolding based alorithms for the reachability problem
• A structural approach for the analysis of Petri nets by reduced unfoldings

Describes a project that uses

Uses Software

• Punf
• Mole

This page was built for publication: Goal-driven unfolding of Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111631)