SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA

DOI10.1142/S0129054107004942MaRDI QIDQ3503089zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri

Publication date 20 May 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107004942

zbMATH Keywords

AlternationBüchi automatafair transition systemformal verificationmodel checkingsymbolic methods

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Symbolic Implementation of Alternating Automata
• Language-emptiness checking of alternating tree automata using symbolic reachability analysis
• scientific article; zbMATH DE number 1775458
• Fixed point guided abstraction refinement for alternating automata
• Fixpoint Guided Abstraction Refinement for Alternating Automata

Cites work

• Alternating finite automata on -words
• Alternation
• Weak alternating automata are not that weak

Cited in

(11)

• Fixed point guided abstraction refinement for alternating automata
• A symbolic decision procedure for symbolic alternating finite automata
• SMT-based generation of symbolic automata
• Compositional SCC analysis for language emptiness
• Language-emptiness checking of alternating tree automata using symbolic reachability analysis
• Alternation removal in Büchi automata
• Fixpoint Guided Abstraction Refinement for Alternating Automata
• Symbolic bounded synthesis
• Symbolic Implementation of Alternating Automata
• Simplifying Alternating Automata for Emptiness Testing
• On regular temporal logics with past

This page was built for publication: SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA

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