Solving Games Without Determinization
From MaRDI portal
Recommendations
- Solving games dependence of applicable solving procedures
- Solving counter parity games
- scientific article; zbMATH DE number 3139280
- Solution for a class of repeated games without a recursive structure
- Solving Simple Stochastic Games
- Game Theory without Decision-Theoretic Paradoxes
- Solving possibilistic games with incomplete information
Cited in
(61)- Using the compatibility analysis of logical specifications of automata to solve game problems
- Strategy representation by decision trees in reactive synthesis
- LTL receding horizon control for finite deterministic systems
- Quantitative vs. weighted automata
- Non-zero sum games for reactive synthesis
- Functional encryption for inner product with full function privacy
- Effective synthesis of asynchronous systems from GR(1) specifications
- scientific article; zbMATH DE number 6486247 (Why is no real title available?)
- Semantic labelling and learning for parity game solving in LTL synthesis
- On synthesis of specifications with arithmetic
- Optimal Translation of LTL to Limit Deterministic Automata
- Width of non-deterministic automata
- On Determinisation of Good-for-Games Automata
- Ranking Automata and Games for Prioritized Requirements
- scientific article; zbMATH DE number 4049147 (Why is no real title available?)
- Synthesis of Reactive(1) designs
- Symbolic bounded synthesis
- Canonicity in GFG and transition-based automata
- scientific article; zbMATH DE number 7471692 (Why is no real title available?)
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- The Theory of Universal Graphs for Infinite Duration Games
- Quantifying Bounds in Strategy Logic
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Minimization and canonization of GFG transition-based automata
- Register games
- How deterministic are good-for-games automata?
- Reactive synthesis without regret
- Computing the width of non-deterministic automata
- From LTL to Symbolically Represented Deterministic Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Good for games automata: from nondeterminism to alternation
- Good-for-Game QPTL: An Alternating Hodges Semantics
- On the power of finite ambiguity in Büchi complementation
- Taming strategy logic: non-recurrent fragments
- On history-deterministic one-counter nets
- Markov chains and unambiguous automata
- A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
- Minimization of automata for liveness languages
- Alternating good-for-MDPs automata
- History-deterministic timed automata are not determinizable
- Semantic flowers for good-for-games and deterministic automata
- A Myhill-Nerode theorem for higher-dimensional automata
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Coalgebraic satisfiability checking for arithmetic -calculi
- Checking history-determinism is NP-hard for parity automata
- History-deterministic timed automata
- Discounted-sum automata with multiple discount factors
- Minimising good-for-games automata is NP-complete
- A hierarchy of nondeterminism
- Strategic dominance: a new preorder for nondeterministic processes
- History-determinism vs fair simulation
- Lookahead games and efficient determinisation of history-deterministic Büchi automata
- History-deterministic Parikh automata
- Discounted-sum automata with multiple discount factors
- History-deterministic Parikh automata
- History-deterministic vector addition systems
- Optimal transformations of games and automata using Muller conditions
- Positionality in _0² and a completeness result
- On the minimisation of deterministic and history-deterministic generalised (co)Büchi automata
- Resolving nondeterminism with randomness
- Resolving nondeterminism by chance
This page was built for publication: Solving Games Without Determinization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613352)
