Advertisement

Mu-Calculus Model Checking

Chapter
  • 232 Downloads

Abstract

The Mu-Calculus [Par74] is a logic based on extremal fixed points that is strictly more expressive than CTL,1 and can also express a variety of properties of transition systems, such as reachable state sets, state equivalence relations, and language containment between automata. A symbolic model checking algorithm for this logic allows all of these properties to be computed using OBDDs [BCM+90].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityAustralia

Personalised recommendations