SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA

DOI10.1142/S0129054107004942zbMath1142.68418DBLPjournals/ijfcs/BloemCPR07OpenAlexW2107078774WikidataQ62041327 ScholiaQ62041327MaRDI QIDQ3503089

Ingo Pill, Alessandro Cimatti, Marco Roveri, Roderick Bloem

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

formal verificationmodel checkingBüchi automatasymbolic methodsAlternationfair transition system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Symbolic bounded synthesis ⋮ On regular temporal logics with past

Cites Work

• Alternating finite automata on \(\omega\)-words
• Weak alternating automata are not that weak
• Alternation

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