Solving Games Without Determinization
From MaRDI portal
Publication:3613352
DOI10.1007/11874683_26zbMATH Open1225.68118OpenAlexW1594196576MaRDI QIDQ3613352FDOQ3613352
Authors: Nir Piterman, Thomas A. Henzinger 
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_26
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
2-person games (91A05) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)
Cited In (46)
- From LTL to Symbolically Represented Deterministic Automata
- Ranking Automata and Games for Prioritized Requirements
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Effective synthesis of asynchronous systems from GR(1) specifications
- On Determinisation of Good-for-Games Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Theory of Universal Graphs for Infinite Duration Games
- Quantifying Bounds in Strategy Logic
- Functional encryption for inner product with full function privacy
- Alternating good-for-MDPs automata
- Minimization of automata for liveness languages
- On the power of finite ambiguity in Büchi complementation
- Title not available (Why is that?)
- Good-for-Game QPTL: An Alternating Hodges Semantics
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi
- Non-zero sum games for reactive synthesis
- Title not available (Why is that?)
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Symbolic bounded synthesis
- Synthesis of Reactive(1) designs
- Markov chains and unambiguous automata
- Semantic labelling and learning for parity game solving in LTL synthesis
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Title not available (Why is that?)
- Title not available (Why is that?)
- History-deterministic timed automata
- Semantic flowers for good-for-games and deterministic automata
- Taming strategy logic: non-recurrent fragments
- Checking history-determinism is NP-hard for parity automata
- Using the compatibility analysis of logical specifications of automata to solve game problems
- On history-deterministic one-counter nets
- Optimal Translation of LTL to Limit Deterministic Automata
- History-deterministic timed automata are not determinizable
- Computing the width of non-deterministic automata
- How deterministic are good-for-games automata?
- Width of non-deterministic automata
- Strategy representation by decision trees in reactive synthesis
- Title not available (Why is that?)
- On synthesis of specifications with arithmetic
- A Myhill-Nerode theorem for higher-dimensional automata
- Quantitative vs. weighted automata
- LTL receding horizon control for finite deterministic systems
- A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Reactive synthesis without regret
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)
