Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

DOI10.1007/978-3-642-02930-1_19zbMath1248.68334arXiv1109.5267OpenAlexW2141566236MaRDI QIDQ5902152

No author found.

Publication date: 14 July 2009

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

Full work available at URL: https://arxiv.org/abs/1109.5267

Mathematics Subject Classification ID

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)

Typing Weak MSOL Properties ⋮ On higher-order reachability games vs may reachability ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus