Symbolic computational techniques for solving games
From MaRDI portal
Recommendations
Cited in
(18)- Towards scalable synthesis of stochastic control systems
- Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface
- Using the compatibility analysis of logical specifications of automata to solve game problems
- Reachability games on automatic graphs
- Synthesis of fault-tolerant embedded systems using games: from theory to practice
- Cobra: a tool for solving general deductive games
- Solving μ-Calculus Parity Games by Symbolic Planning
- Symbolic bounded synthesis
- scientific article; zbMATH DE number 1863183 (Why is no real title available?)
- scientific article; zbMATH DE number 7340142 (Why is no real title available?)
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- A Procedural Characterization of Solution Concepts in Games
- Quantified Boolean Solving for Achievement Games
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Games and winning strategies
- Causality-based game solving
- Solving games via three-valued abstraction refinement
This page was built for publication: Symbolic computational techniques for solving games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845509)
