On the universal and existential fragments of the \(\mu\)-calculus

DOI10.1016/j.tcs.2005.11.015zbMath1088.68106MaRDI QIDQ2368950

Orna Kupferman, Thomas A. Henzinger, Rupak Majumdar

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.015

zbMATH Keywords

Satisfiability; Model checking; \(\mu\)-Calculus; Automata and logic

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

68Q60: Specification and verification (program logics, model checking, etc.)