Alternating tree automata, parity games, and modal \(\mu\)-calculus
From MaRDI portal
Publication:5952907
zbMath0994.68079MaRDI QIDQ5952907
Publication date: 14 January 2002
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
More Precise Partition Abstractions, Model Checking for Action Abstraction, Complexity of Decision Problems for Mixed and Modal Specifications, Solving Parity Games in Big Steps, Improved model checking of hierarchical systems, On modal \(\mu \)-calculus and Gödel-Löb logic, On modal \(\mu\)-calculus and non-well-founded set theory, From Parity and Payoff Games to Linear Programming, Distributed Synthesis for Alternating-Time Logics, ATL* Satisfiability Is 2EXPTIME-Complete, Tighter Bounds for the Determinisation of Büchi Automata