On modal \(\mu \)-calculus over finite graphs with small components or small tree width
type: Item
instance of: scholarly article
zbMATH Open document ID: 1245.03025
DOI: 10.1142/S012905411240031X
author: Giovanna D'Agostino
author: Giacomo Lenzi
published in: International Journal of Foundations of Computer Science
publication date: 2012-08-30T00:00:00Z
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 6073962
zbMATH Keywords: modal \(\mu \)-calculus
zbMATH Keywords: strongly connected component
zbMATH Keywords: tree width
MaRDI profile type: Publication
cites work: The modalμ-calculus hierarchy over restricted classes of transition systems
cites work: On modal \(\mu \)-calculus and Gödel-Löb logic
cites work: Rudiments of \(\mu\)-calculus
cites work: Modal characterisation theorems over special classes of frames
cites work: S-functions for graphs
cites work: Directed tree-width
cites work: A Deterministic Subexponential Algorithm for Solving Parity Games
cites work: Results on the propositional \(\mu\)-calculus
cites work: Borel determinacy
cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
cites work: Fixed point characterization of infinite behavior of finite-state systems
cites work: Graph minors. III. Planar tree-width
cites work: Graph minors. V. Excluding a planar graph
cites work: Modal frame correspondences and fixed-points
full work available at URL: s012905411240031x
OpenAlex ID: W2083449758
title: On modal \(\mu \)-calculus over finite graphs with small components or small tree width
description: scientific article; zbMATH DE number 6073962