The Complexity of Enriched μ-Calculi

DOI10.1007/11787006_46zbMath1133.68374MaRDI 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

68Q45: Formal languages and automata

03B45: Modal logic (including the logic of norms)

68Q60: Specification and verification (program logics, model checking, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

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