Alternating tree automata, parity games, and modal -calculus
From MaRDI portal
Publication:5952907
zbMATH Open0994.68079MaRDI QIDQ5952907FDOQ5952907
Authors: Thomas Wilke 
Publication date: 14 January 2002
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Recommendations
- Modal μ-Calculus and Alternating Tree Automata
- Alternating Tree Automata and Parity Games
- scientific article; zbMATH DE number 4051592
- Publication:4938419
- Automata, Logic and Games for the $$\lambda $$ -Calculus
- Alternating automata, the weak monadic theory of trees and its complexity
- Automata for the modal \(\mu \)-calculus and related results
- Publication:4726235
- Parity games and automata for game logic
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
Cited In (47)
- Mu-depth 3 is more than 2: A game-theoretic proof
- Improving parity games in practice
- ATL* Satisfiability Is 2EXPTIME-Complete
- Deciding Parity Games in Quasi-polynomial Time
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved model checking of hierarchical systems
- Solving parity games via priority promotion
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Expressiveness and succinctness of a logic of robustness
- Symmetric Strategy Improvement
- Distributed Synthesis for Alternating-Time Logics
- Tighter Bounds for the Determinisation of Büchi Automata
- Model Checking for Action Abstraction
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- On modal \(\mu\)-calculus and non-well-founded set theory
- Complexity of Decision Problems for Mixed and Modal Specifications
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
- Refinement sensitive formal semantics of state machines with persistent choice
- Priority promotion with Parysian flair
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
- Alternating Tree Automata and Parity Games
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Model-checking iterated games
- Solving parity games in big steps
- From Parity and Payoff Games to Linear Programming
- Modular games for coalgebraic fixed point logics
- Solving Parity Games in Big Steps
- On the size of disjunctive formulas in the \(\mu\)-calculus
- Size measures and alphabetic equivalence in the \(\mu \)-calculus
- Solving Parity Games Using an Automata-Based Algorithm
- Equivalence of probabilistic \(\mu\)-calculus and p-automata
- Robust worst cases for parity games algorithms
- Modal μ-Calculus and Alternating Tree Automata
- A focus system for the alternation-free \(\mu \)-calculus
- Quantitative vs. weighted automata
- A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata
- More Precise Partition Abstractions
- Simulation Relations for Alternating Parity Automata and Parity Games
- A compositional approach to parity games
- Title not available (Why is that?)
This page was built for publication: Alternating tree automata, parity games, and modal \(\mu\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952907)
