Synthesising Succinct Strategies in Safety and Reachability Games
From MaRDI portal
Publication:3447698
Recommendations
- Synthesising succinct strategies in safety games with an application to real-time scheduling
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- scientific article; zbMATH DE number 7204389
- Stochastic games with lexicographic reachability-safety objectives
- Termination criteria for solving concurrent safety and reachability games
- Symbolic verification and strategy synthesis for turn-based stochastic games
- Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper)
- Optimal strategies in pushdown reachability games
- Tools and Algorithms for the Construction and Analysis of Systems
- Optimally Resilient Strategies in Pushdown Safety Games
Cited in
(9)- Causality-based game solving
- On-the-Fly Synthesis for Strictly Alternating Games
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- Synthesising succinct strategies in safety games with an application to real-time scheduling
- Strategy Representation by Decision Trees with Linear Classifiers
- Strategy representation by decision trees in reactive synthesis
- A symbolic algorithm for lazy synthesis of eager strategies
- Small strategies for safety games
- Synthesis of finite-state and definable winning strategies
This page was built for publication: Synthesising Succinct Strategies in Safety and Reachability Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447698)