Mediating for reduction (on minimizing alternating Büchi automata)

DOI10.1016/j.tcs.2014.08.003zbMath1360.68536OpenAlexW1965927648MaRDI QIDQ740970

Tomáš Vojnar, Yu-Fang Chen, Parosh Aziz Abdulla, Lukáš Holík

Publication date: 10 September 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.003

zbMATH Keywords

simulationreductionquotientalternating Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• LTL2BA
• GOAL

Cites Work

• Simulation relations for alternating Büchi automata
• Weak alternating automata are not that weak
• A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
• Automata-Theoretic Model Checking Revisited
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Computing Simulations over Tree Automata
• Correct Hardware Design and Verification Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item