The Complexity of Enriched μ-Calculi

DOI10.1007/11787006_46MaRDI QIDQ3591423zbMATH OpenOpenAlexFDO

Authors Carsten Lutz, Aniello Murano, Moshe Y. Vardi, P. A. Bonatti

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_46

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The Complexity of Enriched Mu-Calculi
• Enriched μ-Calculi Module Checking
• Enriched MU-Calculi Module Checking
• Enriched μ–Calculus Pushdown Module Checking
• On model checking for the -calculus and its fragments

Cited in

(8)

• Enriched μ–Calculus Pushdown Module Checking
• Enriched MU-Calculi Module Checking
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• A goal-directed decision procedure for hybrid PDL
• Some results on complexity of -calculus evaluation in the black-box model
• Enriched μ-Calculi Module Checking
• The Complexity of Enriched Mu-Calculi
• Model checking for hybrid branching-time logics

This page was built for publication: The Complexity of Enriched μ-Calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591423)