Minimizing Generalized Büchi Automata

DOI10.1007/11817963_7MaRDI QIDQ5756738zbMATH OpenOpenAlexFDO

Authors Sudeep Juvekar, Nir Piterman

Publication date 5 September 2007

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817963_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimising deterministic Büchi automata precisely using SAT solving
• Minimisation of automata
• scientific article; zbMATH DE number 3874624
• Minimization of Mizumoto automata
• scientific article; zbMATH DE number 7199591
• scientific article; zbMATH DE number 6917169
• scientific article; zbMATH DE number 4166871
• scientific article; zbMATH DE number 4108165
• The minimization of a kind of non-deterministic finite automata

Cited in

(9)

• Mediating for reduction (on minimizing alternating Büchi automata)
• Advanced automata minimization
• Büchi automata can have smaller quotients
• Some Minimality Results on Biresidual and Biseparable Automata
• Synthesis of Reactive(1) designs
• On the Construction of a Family of Automata That Are Generically Non-minimal
• Simulation relations and applications in formal methods
• On the minimisation of deterministic and history-deterministic generalised (co)Büchi automata
• Mediating for reduction (on minimizing alternating Büchi automata)

This page was built for publication: Minimizing Generalized Büchi Automata

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