From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
From MaRDI portal
Publication:5426071
DOI10.2168/LMCS-3(3:5)2007zbMath1125.68067MaRDI QIDQ5426071
Publication date: 15 November 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (46)
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ From LTL to deterministic automata. A safraless compositional approach ⋮ Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ Looking at mean payoff through foggy windows ⋮ Symmetric Strategy Improvement ⋮ Automata Theory and Model Checking ⋮ The mu-calculus and Model Checking ⋮ Linear temporal logic -- from infinite to finite horizon ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ From Parity and Payoff Games to Linear Programming ⋮ Solving parity games in big steps ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Unnamed Item ⋮ Index appearance record with preorders ⋮ A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Profile trees for Büchi word automata, with application to determinization ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Justifications and a reconstruction of parity game solving algorithms ⋮ Realizability problem for constraint LTL ⋮ Unnamed Item ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Symbolic bounded synthesis ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis ⋮ Synthesis of Data Word Transducers ⋮ From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata ⋮ Index Appearance Record for Transforming Rabin Automata into Parity Automata ⋮ On relative and probabilistic finite counterability ⋮ Opacity for linear constraint Markov chains ⋮ Reactive synthesis without regret ⋮ Doomsday equilibria for omega-regular games ⋮ A tighter analysis of Piterman's Büchi determinization ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ Tighter Bounds for the Determinisation of Büchi Automata ⋮ Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata ⋮ State of Büchi Complementation ⋮ Program repair without regret ⋮ Realizability of Real-Time Logics ⋮ \( \omega \)-automata ⋮ Model Checking Omega-regular Properties for Quantum Markov Chains ⋮ Rabin vs. Streett Automata ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics
This page was built for publication: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
