Sharp disjunctive decomposition for language emptiness checking

DOI10.1007/3-540-36126-X_7MaRDI QIDQ4427898zbMATH OpenFDO

Authors Chao Wang, Gary D. Hachtel

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2517/25170106.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computer science aspects of computer-aided design (68U07)

Recommendations

• Compositional SCC analysis for language emptiness
• Divide and compose: SCC refinement for language emptiness
• Nested emptiness search for generalized Büchi automata
• Strength-based decomposition of the property Büchi automaton for faster model checking
• Three SCC-based emptiness checks for generalized Büchi automata

Cited in

(3)

• GSTE is partitioned model checking
• Compositional SCC analysis for language emptiness
• Divide and compose: SCC refinement for language emptiness

This page was built for publication: Sharp disjunctive decomposition for language emptiness checking

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