Search

• < Previous
• 1
• Next >

---

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;]

---

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;]

---

Reasoning about Strategies: on the Satisfiability Problem

Fabio Mogavero ; Aniello Murano ; Giuseppe Perelli ; Moshe Y. Vardi.

Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, subsuming all major previously studied modal logics&nbsp;[&hellip;]

---