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

DOI10.1016/J.TCS.2014.08.003zbMATH Open1360.68536OpenAlexW1965927648MaRDI QIDQ740970FDOQ740970

Authors: Parosh A. Abdulla, Yu-Fang Chen, Lukáš Holik, Tomáš Vojnar 

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

Recommendations

• Mediating for reduction (on minimizing alternating Büchi automata)
• scientific article; zbMATH DE number 1954381
• Simulation relations for alternating Büchi automata
• Minimising deterministic Büchi automata precisely using SAT solving
• Minimizing Generalized Büchi Automata

zbMATH Keywords

simulationquotientreductionalternating Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• A uniform (bi-)simulation-based framework for reducing tree automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weak alternating automata are not that weak
• Computing Simulations over Tree Automata
• Automata-Theoretic Model Checking Revisited
• Title not available (Why is that?)
• Simulation relations for alternating Büchi automata
• Mediating for reduction (on minimizing alternating Büchi automata)
• On complementing nondeterministic Büchi automata

Cited In (3)

• Title not available (Why is that?)
• Modular mix-and-match complementation of Büchi automata
• Mediating for reduction (on minimizing alternating Büchi automata)

Uses Software

• LTL2BA
• GOAL

This page was built for publication: Mediating for reduction (on minimizing alternating Büchi automata)

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