Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
From MaRDI portal
Publication:3613365
DOI10.1007/11874683_39zbMath1225.68124OpenAlexW1525083854MaRDI 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
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)
Related Items
Symmetric Strategy Improvement, From Parity and Payoff Games to Linear Programming, Solving parity games in big steps, Robust worst cases for parity games algorithms, Model checking open systems with alternating projection temporal logic, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, ATL* Satisfiability Is 2EXPTIME-Complete, Unnamed Item, Unnamed Item, Solving parity games via priority promotion, Alternating-time temporal logics with linear past, Unnamed Item, Tighter Bounds for the Determinisation of Büchi Automata, Solving Parity Games in Big Steps
