A new algorithm for strategy synthesis in LTL games
From MaRDI portal
Recommendations
Cited in
(18)- Practical synthesis of reactive systems from LTL specifications via parity games
- A symbolic algorithm for lazy synthesis of eager strategies
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
- Synthesis of finite-state and definable winning strategies
- Semantic labelling and learning for parity game solving in LTL synthesis
- Synthesising Succinct Strategies in Safety and Reachability Games
- An Antichain Algorithm for LTL Realizability
- Synthesis of Reactive(1) designs
- Antichains and compositional algorithms for LTL synthesis
- Compositional algorithms for LTL synthesis
- Model-Free Reinforcement Learning for Stochastic Parity Games
- On-the-Fly Synthesis for Strictly Alternating Games
- Synthesis from LTL specifications with mean-payoff objectives
- A Hybrid Algorithm for LTL Games
- Guessing winning policies in LTL synthesis by semantic learning
- Problems of synthesis of -automata specified in languages LP and LF of first order logic
- Causality-based game solving
This page was built for publication: A new algorithm for strategy synthesis in LTL games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703780)