Partial order reduction for reachability games

DOI10.4230/LIPIcs.CONCUR.2019.23OpenAlexW2970425440MaRDI QIDQ5875384

Frederik M. Bønneland, Marco Muñiz, Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2019.23

zbMATH Keywords

synthesisPetri netsgamespartial order reductionstubborn sets

Mathematics Subject Classification ID

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

Related Items

Stubborn set reduction for timed reachability and safety games ⋮ Elimination of detached regions in dependency graph verification ⋮ Exponential automatic amortized resource analysis ⋮ The inconsistent labelling problem of stutter-preserving partial-order reduction ⋮ Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems

Uses Software

• TAPAAL

Cites Work

• Unnamed Item
• A stubborn attack on state explosion
• PTrie: data structure for compressing and storing sets via prefix sharing
• Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
• Stubborn Sets for Simple Linear Time Properties
• Concurrent Games on VASS with Inhibition
• A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*
• Stubborn Set Intuition Explained
• On the complexity of resource-bounded logics
• Start pruning when time gets urgent: partial order reduction for timed systems
• Partial-order reduction in the weak modal mu-calculus