SnS can be modally characterized

DOI10.1016/0304-3975(90)90140-DzbMath0701.68064MaRDI QIDQ914397

Hans Hüttel

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrent systemstree languagestransitionsmodal mu-calculusRabin's tree theoremsecond-order monadic theory of n successors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Second- and higher-order model theory (03C85)

Related Items (2)

On modal mu-calculus and Büchi tree automata ⋮ Local model checking for infinite state spaces

Cites Work

• The temporal logic of branching time
• Results on the propositional \(\mu\)-calculus
• Preservation of expressive completeness in temporal models
• Temporal logic can be more expressive
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SnS can be modally characterized