Modal μ-Calculus and Alternating Tree Automata

  • Júlia Zappe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)


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 [100]. 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.


These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Júlia Zappe
    • 1
  1. 1.Institut für InformatikLudwig-Maximilians-Universität MünchenGermany

Personalised recommendations