On the \(\mu \)-calculus over transitive and finite transitive frames
From MaRDI portal
Publication:606994
DOI10.1016/j.tcs.2010.09.002zbMath1208.68145MaRDI QIDQ606994
Giovanna D'Agostino, Giacomo Lenzi
Publication date: 19 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.002
collapse; fixed points; alternation hierarchy; modal \(\mu \)-calculus; Büchi and co-Büchi definable; finite transitive frames
03B45: Modal logic (including the logic of norms)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Unnamed Item, Unnamed Item, The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames, The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity, The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs, Fixed-Point Elimination in the Intuitionistic Propositional Calculus
Cites Work
- Unnamed Item
- Modal characterisation theorems over special classes of frames
- Results on the propositional \(\mu\)-calculus
- An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
- The modal mu-calculus alternation hierarchy is strict
- A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames
- Automata for the modal μ-calculus and related results
- The modalμ-calculus hierarchy over restricted classes of transition systems
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- Rudiments of \(\mu\)-calculus