Pages that link to "Item:Q2845509"
From MaRDI portal
The following pages link to Symbolic computational techniques for solving games (Q2845509):
Displaying 13 items.
- Symbolic bounded synthesis (Q453535) (← links)
- Games and winning strategies (Q674272) (← links)
- Solving games via three-valued abstraction refinement (Q979079) (← links)
- Towards scalable synthesis of stochastic control systems (Q1693824) (← links)
- Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface (Q2081803) (← links)
- Using the compatibility analysis of logical specifications of automata to solve game problems (Q2263301) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to Practice (Q3075475) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- (Q4986508) (← links)
- (Q5020998) (← links)
- A Procedural Characterization of Solution Concepts in Games (Q5404390) (← links)
- Quantified Boolean Solving for Achievement Games (Q6488139) (← links)