SnS can be modally characterized

DOI10.1016/0304-3975(90)90140-DMaRDI QIDQ914397zbMATH OpenFDO

Authors Hans Hüttel

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0304-3975(90)90140-D

zbMATH Keywords

concurrent systemsmodal mu-calculusRabin's tree theoremsecond-order monadic theory of n successorstransitionstree languages

Mathematics Subject Classification ID

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

Cites work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 4016870 (Why is no real title available?)
• scientific article; zbMATH DE number 3887063 (Why is no real title available?)
• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• Preservation of expressive completeness in temporal models
• Results on the propositional \(\mu\)-calculus
• Temporal logic can be more expressive
• The temporal logic of branching time

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914397)