Alternating tree automata, parity games, and modal -calculus
From MaRDI portal
Publication:5952907
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
(49)- The descriptive complexity of modal \(\mu\) model-checking games
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Priority promotion with Parysian flair
- Mu-depth 3 is more than 2: A game-theoretic proof
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- On modal \(\mu\)-calculus and non-well-founded set theory
- ATL* Satisfiability Is 2EXPTIME-Complete
- Simulation Relations for Alternating Parity Automata and Parity Games
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- scientific article; zbMATH DE number 4041274 (Why is no real title available?)
- Equivalence of probabilistic \(\mu\)-calculus and p-automata
- Modular games for coalgebraic fixed point logics
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Deciding Parity Games in Quasi-polynomial Time
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
- A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Improved model checking of hierarchical systems
- Modal μ-Calculus and Alternating Tree Automata
- Distributed Synthesis for Alternating-Time Logics
- Permutation games for the weakly aconjunctive \(\mu \)-calculus
- On the size of disjunctive formulas in the \(\mu\)-calculus
- Size measures and alphabetic equivalence in the \(\mu \)-calculus
- A focus system for the alternation-free \(\mu \)-calculus
- Complexity of Decision Problems for Mixed and Modal Specifications
- A compositional approach to parity games
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata
- Refinement sensitive formal semantics of state machines with persistent choice
- Tighter Bounds for the Determinisation of Büchi Automata
- More Precise Partition Abstractions
- Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
- Model-checking iterated games
- Expressiveness and succinctness of a logic of robustness
- Model Checking for Action Abstraction
- Alternating Tree Automata and Parity Games
- Symmetric strategy improvement
- Improving parity games in practice
- Solving parity games using an automata-based algorithm
- Solving Parity Games in Big Steps
- Solving parity games via priority promotion
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Solving parity games in big steps
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- Quantitative vs. weighted automata
- Inseparability and conservative extensions of description logic ontologies: a survey
- From Parity and Payoff Games to Linear Programming
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Robust worst cases for parity games algorithms
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)
