The Complexity of Enriched μ-Calculi

DOI10.1007/11787006_46zbMath1133.68374OpenAlexW2107444004MaRDI QIDQ3591423

Carsten Lutz, Aniello Murano, Moshe Y. Vardi, Piero 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) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Enriched μ–Calculus Pushdown Module Checking ⋮ Model checking for hybrid branching-time logics ⋮ Branching-Time Temporal Logics with Minimal Model Quantifiers ⋮ A goal-directed decision procedure for hybrid PDL

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