scientific article; zbMATH DE number 7204935

DOI10.4230/LIPIcs.CONCUR.2017.18zbMath1442.68132arXiv1611.01296MaRDI QIDQ5111631

Loïc Paulevé, Thomas Chatain

Publication date: 27 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilityPetri netsmodel reductionconcurrencyunfoldingsautomata networks

Mathematics Subject Classification ID

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

Related Items

Concurrency in Boolean networks ⋮ Static analysis and stochastic search for reachability problem ⋮ A lazy query scheme for reachability analysis in Petri nets

Uses Software

• Punf
• Mole

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient unfolding of contextual Petri nets
• Complexity results for 1-safe nets
• An improvement of McMillan's unfolding algorithm
• Goal-oriented reduction of automata networks
• Canonical prefixes of Petri net unfoldings
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
• Unfoldings: A partial-order approach to model checking.
• Directed Unfolding of Petri Nets
• Dynamic partial-order reduction for model checking software
• Peephole Partial Order Reduction