Stubborn set reduction for timed reachability and safety games

DOI10.1007/978-3-030-85037-1_3MaRDI QIDQ832029zbMATH OpenOpenAlexFDO

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

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85037-1_3

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1361136 (Why is no real title available?)
• scientific article; zbMATH DE number 1059329 (Why is no real title available?)
• A partial order approach to branching time logic model checking.
• A stubborn attack on state explosion
• Combining partial-order reductions with on-the-fly model-checking.
• Delay-dependent partial order reduction technique for real time systems
• Parametric real-time reasoning
• Partial order reduction for reachability games
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
• Reasoning about systems with many processes
• Start pruning when time gets urgent: partial order reduction for timed systems
• Stubborn set reduction for two-player reachability games
• TAPAAL 2.0: integrated development environment for timed-arc Petri nets
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Cited in

(1)

• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

Describes a project that uses

Uses Software

• GitHub
• TAPAAL

This page was built for publication: Stubborn set reduction for timed reachability and safety games

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