Stubborn set reduction for timed reachability and safety games
From MaRDI portal
Publication:832029
DOI10.1007/978-3-030-85037-1_3OpenAlexW3195050943MaRDI QIDQ832029
Jiří Srba, Marco Muñiz, Kim Guldstrand Larsen, Frederik M. Bønneland, 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
Uses Software
Cites Work
- 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
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- A partial order approach to branching time logic model checking.
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
- TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
- Reasoning about systems with many processes
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems
- Parametric real-time reasoning
- Partial order reduction for reachability games
- Start pruning when time gets urgent: partial order reduction for timed systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
