Solving Games Without Determinization

DOI10.1007/11874683_26zbMath1225.68118OpenAlexW1594196576MaRDI QIDQ3613352

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) Games involving graphs (91A43) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (35)

Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ Effective Synthesis of Asynchronous Systems from GR(1) Specifications ⋮ The Theory of Universal Graphs for Infinite Duration Games ⋮ On Determinisation of Good-for-Games Automata ⋮ LTL receding horizon control for finite deterministic systems ⋮ Unnamed Item ⋮ Width of Non-deterministic Automata ⋮ 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 ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Minimization of automata for liveness languages ⋮ Alternating good-for-MDPs automata ⋮ Unnamed Item ⋮ History-deterministic timed automata are not determinizable ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Semantic flowers for good-for-games and deterministic automata ⋮ Quantitative vs. weighted automata ⋮ Synthesis of Reactive(1) designs ⋮ Symbolic bounded synthesis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Synthesis of Specifications with Arithmetic ⋮ Optimal Translation of LTL to Limit Deterministic Automata ⋮ Reactive synthesis without regret ⋮ Functional Encryption for Inner Product with Full Function Privacy ⋮ Unnamed Item ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ Unnamed Item ⋮ Quantifying Bounds in Strategy Logic ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable ⋮ How Deterministic are Good-For-Games Automata? ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

This page was built for publication: Solving Games Without Determinization