Language-emptiness checking of alternating tree automata using symbolic reachability analysis

MaRDI QIDQ2852024zbMATH OpenFDO

Authors Kairong Qian, Albert Nymeyer

Publication date 7 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066106000685

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• An automata-theoretic approach to branching-time model checking
• scientific article; zbMATH DE number 1775458
• scientific article; zbMATH DE number 1701748
• Reachability analysis of pushdown automata: Application to model-checking

Cited in

(2)

• Abstraction refinement for emptiness checking of alternating data automata
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA

This page was built for publication: Language-emptiness checking of alternating tree automata using symbolic reachability analysis

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