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

DOI10.2168/LMCS-7(4:9)2011zbMath1237.68124OpenAlexW1989109065MaRDI QIDQ5895528

No author found.

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-7(4:9)2011

zbMATH Keywords

complexitymodel checkingmodal mu-calculushigher-order recursion schemes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ Functional programs as compressed data ⋮ Static and dynamic property-preserving updates ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Unnamed Item ⋮ The Complexity of the Diagonal Problem for Recursion Schemes

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