The modal mu-calculus alternation hierarchy is strict

Results on the propositional μ-calculus

Dexter Kozen · Theoretical Computer Science · 1983 · 1.8K citations

Humanities, Mathematics, Logic +4

EFFICIENT MODEL CHECKING IN FRAGMENTS OF THE PROPOSITIONAL MU-CALCULUS.

E. Allen Emerson, Chin Laung Lei · Logic in Computer Science · 1986 · 433 citations

Computing, Computer Science, Formal Methods +10

The complexity of tree automata and logics of programs

E. Allen Emerson, Charanjit S. Jutla · 1988 · 298 citations

Computing, Computer Science, Algorithms +16

An automata theoretic decision procedure for the propositional mu-calculus

Robert S. Streett, E. Allen Emerson · Information and Computation · 1989 · 218 citations

Computing, Computer Science, Algorithms +12

Verification of Modal Properties Using Boolean Equation Systems

Angelika Mader · University of Twente Research Information · 1997 · 96 citations · Full text

Computing, Computer Science, Formal Methods +5