scientific article; zbMATH DE number 1304332

MaRDI QIDQ4251063zbMATH OpenFDO

Authors Orna Kupferman, Moshe Y. Vardi

Publication date 16 November 1999

zbMATH Keywords

alternation-free \(\mu\)-calculusefficient symbolic model checkingnondeterministic Büchi tree automataspecification of systemsverificationweak alternating tree automataweak monadic second-order logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Weak alternating automata are not that weak
• scientific article; zbMATH DE number 1775458
• From linear time to branching time
• The Power of the Weak
• scientific article; zbMATH DE number 2038748

Cited in

(9)

• Ambiguous classes in \(\mu\)-calculi hierarchies
• Unambiguous Büchi Is Weak
• On the weak index problem for game automata
• Efficiently deciding -calculus with converse over finite trees
• Weak alternating automata are not that weak
• scientific article; zbMATH DE number 1775458 (Why is no real title available?)
• On the strength of unambiguous tree automata
• scientific article; zbMATH DE number 6424084 (Why is no real title available?)
• A Characterisation of Pi^0_2 Regular Tree Languages

This page was built for publication:

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