Alternation removal in Büchi automata

DOI10.1007/978-3-642-14162-1_7MaRDI QIDQ3587428zbMATH OpenOpenAlexFDO

Authors Udi Boker, Orna Kupferman, Adin Rosenberg

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14162-1_7

Mathematics Subject Classification ID

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

Recommendations

• Weak alternating automata are not that weak
• Symbolic Implementation of Alternating Automata
• Alternation Elimination by Complementation (Extended Abstract)
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• scientific article; zbMATH DE number 1775458

Cited in

(13)

• Automata theory and model checking
• HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
• Alternation Elimination by Complementation (Extended Abstract)
• Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
• Symbolic Implementation of Alternating Automata
• From Spot 2.0 to Spot 2.10: What’s New?
• Efficient approach of translating LTL formulae into Büchi automata
• scientific article; zbMATH DE number 7649927 (Why is no real title available?)
• The quest for a tight translation of Büchi to co-Büchi automata
• Rabin vs. Streett automata
• Degeneralization algorithm for generation of Büchi automata based on contented situation
• Alternation elimination for automata over nested words
• Practical applications of the alternating cycle decomposition

This page was built for publication: Alternation removal in Büchi automata

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