The Complexity of Enriched Mu-Calculi
From MaRDI portal
Publication:3535618
DOI10.2168/LMCS-4(3:11)2008zbMath1151.03016MaRDI QIDQ3535618
Moshe Y. Vardi, Aniello Murano, Carsten Lutz, Piero A. Bonatti
Publication date: 13 November 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
complexitydecidabilitysatisfiabilityautomata modelsemptiness problemsexpressive fragmentsExpTime-completefully enriched \(\mu \)-calculus
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (15)
Reasoning with Forest Logic Programs Using Fully Enriched Automata ⋮ The mu-calculus and Model Checking ⋮ Querying Regular Graph Patterns ⋮ Reasoning About Strategies ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Reasoning About Substructures and Games ⋮ Presburger Büchi tree automata with applications to logics with expressive counting ⋮ Unnamed Item ⋮ Mu-calculus satisfiability with arithmetic constraints ⋮ Alternating-time temporal logics with linear past ⋮ Reasoning and Query Answering in Description Logics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ CTL\(^\ast\) with graded path modalities ⋮ Cycle detection in computation tree logic ⋮ Model-checking graded computation-tree logic with finite path semantics
This page was built for publication: The Complexity of Enriched Mu-Calculi
