Solving Games Without Determinization

DOI10.1007/11874683_26MaRDI QIDQ3613352zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

(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
• scientific article; zbMATH DE number 7577580 (Why is no real title available?)
• scientific article; zbMATH DE number 4049147 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7649927 (Why is no real title available?)
• On the power of finite ambiguity in Büchi complementation
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi
• Non-zero sum games for reactive synthesis
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• Symbolic bounded synthesis
• Good-for-MDPs automata for probabilistic analysis and reinforcement learning
• Synthesis of Reactive(1) designs
• Semantic labelling and learning for parity game solving in LTL synthesis
• Markov chains and unambiguous automata
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• scientific article; zbMATH DE number 7455749 (Why is no real title available?)
• scientific article; zbMATH DE number 7215285 (Why is no real title available?)
• Semantic flowers for good-for-games and deterministic automata
• History-deterministic timed automata
• Taming strategy logic: non-recurrent fragments
• Using the compatibility analysis of logical specifications of automata to solve game problems
• Checking history-determinism is NP-hard for parity automata
• Optimal Translation of LTL to Limit Deterministic Automata
• On history-deterministic one-counter nets
• History-deterministic timed automata are not determinizable
• Strategy representation by decision trees in reactive synthesis
• Width of non-deterministic automata
• Computing the width of non-deterministic automata
• How deterministic are good-for-games automata?
• scientific article; zbMATH DE number 6486247 (Why is no real title available?)
• On synthesis of specifications with arithmetic
• Quantitative vs. weighted automata
• A Myhill-Nerode theorem for higher-dimensional automata
• LTL receding horizon control for finite deterministic systems
• A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
• Reactive synthesis without regret
• Tools and Algorithms for the Construction and Analysis of Systems

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)