Stubborn set reduction for timed reachability and safety games
From MaRDI portal
Publication:832029
DOI10.1007/978-3-030-85037-1_3OpenAlexW3195050943MaRDI QIDQ832029FDOQ832029
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
Cites Work
- 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 methods for the verification of concurrent systems. An approach to the state-explosion problem
- A stubborn attack on state explosion
- Combining partial-order reductions with on-the-fly model-checking.
- Parametric real-time reasoning
- Title not available (Why is that?)
- A partial order approach to branching time logic model checking.
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Title not available (Why is that?)
- Delay-dependent partial order reduction technique for real time systems
- Partial-order reduction for parity games with an application on parameterised Boolean equation systems
- Stubborn set reduction for two-player reachability games
- Partial order reduction for reachability games
- Start pruning when time gets urgent: partial order reduction for timed systems
Cited In (1)
Uses Software
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)
