Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Enriched MU-Calculi Module Checking

Alessandro Ferrante ; Aniello Murano ; Mimmo Parente.
The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate this problem with respect to the \mu-calculus&nbsp;[&hellip;]
Published on July 29, 2008
Volume 4, Issue 3

The Complexity of Enriched Mu-Calculi

Piero A. Bonatti ; Carsten Lutz ; Aniello Murano ; Moshe Y. Vardi.
The fully enriched &mu;-calculus is the extension of the propositional &mu;-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched &mu;-calculus is known to be decidable and ExpTime-complete, it has recently been&nbsp;[&hellip;]
Published on September 22, 2008
Volume 4, Issue 3
  • < Previous
  • 1
  • Next >