Modal μ-Calculus and Alternating Tree Automata
The modal μ-calculus is a logic that combines simple modal operators with fixed point operators to provide a form of recursion. The modal μ-calculus—as we use it today—was introduced in 1983 by Dexter Kozen . It is well suited for specifying properties of transition systems. For this reason, there is a great interest in efficient solutions of the model checking and the satisfiability problem.
Unable to display preview. Download preview PDF.