59 citations · 249 across the 42 of their papers we have counts for
Showing 2008 · cs.LOShow all
2 papers · 2 filters
cs.LO2008★ 26 cited
The Complexity of Enriched Mu-Calculi
Piero A. Bonatti, Carsten Lutz, Aniello Murano +1
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several express…
cs.LO2008★ 9 cited
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) sy…