scientific article; zbMATH DE number 1775458
From MaRDI portal
Publication:4542592
Recommendations
Cited in
(52)- Solving parity games via priority promotion
- A delayed promotion policy for parity games
- Complexity of weak acceptance conditions in tree automata.
- Fair simulation
- Alternating-time temporal logics with linear past
- Robust worst cases for parity games algorithms
- Answering regular path queries in expressive description logics via alternating tree-automata
- Dicing on the Streett
- A note on the emptiness problem for alternating finite-memory automata
- Bridging the gap between fair simulation and trace inclusion
- The alternation hierarchy in fixpoint logic with chop is strict too
- Relating word and tree automata
- scientific article; zbMATH DE number 1670757 (Why is no real title available?)
- scientific article; zbMATH DE number 1701356 (Why is no real title available?)
- Solving parity games using an automata-based algorithm
- Language-emptiness checking of alternating tree automata using symbolic reachability analysis
- Quasi-weak cost automata: a new variant of weakness
- Reasoning about strategies: on the model-checking problem
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
- Graph Games and Reactive Synthesis
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- A comparison of BDD-based parity game solvers
- scientific article; zbMATH DE number 4170887 (Why is no real title available?)
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
- Weak alternating automata are not that weak
- Alternation removal in Büchi automata
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
- Automata-theoretic decision of timed games
- A survey of stochastic -regular games
- scientific article; zbMATH DE number 1304332 (Why is no real title available?)
- scientific article; zbMATH DE number 1759428 (Why is no real title available?)
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Alternating nonzero automata
- A delayed promotion policy for parity games
- A parity game tale of two counters
- Simple fixpoint iteration to solve parity games
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- Results on alternating-time temporal logics with linear past
- On the Way to Alternating Weak Automata
- Register games
- VLDL satisfiability and model checking via tree automata
- The Complexity of CTL* + Linear Past
- Theoretical Aspects of Computing - ICTAC 2004
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
- Symbolic Implementation of Alternating Automata
- Alternating weak automata from universal trees
- Weak Alternating Timed Automata
- Priority promotion with Parysian flair
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Beyond value iteration for parity games: strategy iteration with universal trees
- Computing threshold budgets in discrete-bidding games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542592)
