Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
From MaRDI portal
Publication:3613365
DOI10.1007/11874683_39zbMath1225.68124MaRDI QIDQ3613365
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_39
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
Related Items
Solving Parity Games in Big Steps, From Parity and Payoff Games to Linear Programming, ATL* Satisfiability Is 2EXPTIME-Complete, Tighter Bounds for the Determinisation of Büchi Automata
