On modal -calculus over finite graphs with small components or small tree width
From MaRDI portal
Publication:2909221
Recommendations
- On modal \(\mu\)-calculus over finite graphs with bounded strongly connected components
- On the modal \(\mu \)-calculus over finite symmetric graphs
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- On modal -calculus over reflexive symmetric graphs
- Fast mu-calculus model checking when tree-width is bounded.
Cites work
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Borel determinacy
- Directed tree-width
- Fixed point characterization of infinite behavior of finite-state systems
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- Modal characterisation theorems over special classes of frames
- Modal frame correspondences and fixed-points
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Results on the propositional \(\mu\)-calculus
- Rudiments of \(\mu\)-calculus
- S-functions for graphs
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- The modal \(\mu \)-calculus hierarchy over restricted classes of transition systems
Cited in
(6)- On the modal \(\mu \)-calculus over finite symmetric graphs
- On modal -calculus over reflexive symmetric graphs
- On modal \(\mu\)-calculus over finite graphs with bounded strongly connected components
- Decomposition theorems and model-checking for the modal \(\mu\)-calculus
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
- Fast mu-calculus model checking when tree-width is bounded.
This page was built for publication: On modal \(\mu \)-calculus over finite graphs with small components or small tree width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909221)
