Stubborn versus structural reductions for Petri nets

DOI10.1016/j.jlamp.2018.09.002zbMath1407.68330OpenAlexW2892268670MaRDI QIDQ1633343

Frederik M. Bønneland, Jiří Srba, Mads Johannsen, Jakob Dyhr, Peter Gjøl Jensen

Publication date: 19 December 2018

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.09.002

zbMATH Keywords

Petri netsreachability analysispartial order reductionstructural reductionsstubborn sets

Mathematics Subject Classification ID

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

Related Items (5)

Accelerating the computation of dead and concurrent places using reductions ⋮ A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking ⋮ Structural Reductions Revisited ⋮ Symbolic and Structural Model-Checking ⋮ On the combination of polyhedral abstraction and SMT-based model checking for Petri nets

Uses Software

• TAPAAL
• LoLA
• PTrie

Cites Work

• A stubborn attack on state explosion
• Question-guided stubborn set methods for state properties
• PTrie: data structure for compressing and storing sets via prefix sharing
• Refinement of trace abstraction for real-time programs
• Stubborn sets with frozen actions
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Fair Testing and Stubborn Sets
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
• Reduction and expansion of live and safe marked graphs
• Stubborn Set Intuition Explained
• Applying CEGAR to the Petri Net State Equation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stubborn versus structural reductions for Petri nets