ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH

DOI10.1142/S012905411240031XzbMath1245.03025OpenAlexW2083449758MaRDI QIDQ2909221

Giacomo Lenzi, Giovanna D'Agostino

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411240031x

zbMATH Keywords

tree widthstrongly connected componentmodal \(\mu \)-calculus

Mathematics Subject Classification ID

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

Cites Work

• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Modal characterisation theorems over special classes of frames
• Graph minors. III. Planar tree-width
• Results on the propositional \(\mu\)-calculus
• On modal \(\mu \)-calculus and Gödel-Löb logic
• Graph minors. V. Excluding a planar graph
• Borel determinacy
• S-functions for graphs
• Fixed point characterization of infinite behavior of finite-state systems
• Directed tree-width
• Modal frame correspondences and fixed-points
• A Deterministic Subexponential Algorithm for Solving Parity Games
• The modalμ-calculus hierarchy over restricted classes of transition systems
• Rudiments of \(\mu\)-calculus

This page was built for publication: ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH