On minimal odd rankings for Büchi complementation

DOI10.1007/978-3-642-04761-9_18MaRDI QIDQ3648701zbMATH OpenOpenAlexFDO

Authors Hrishikesh Karmarkar, Supratik Chakraborty

Publication date 1 December 2009

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04761-9_18

Mathematics Subject Classification ID

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

Recommendations

• Unifying Büchi complementation constructions
• Unifying Büchi complementation constructions
• Complementing Büchi Automata with Ranker
• On complementing nondeterministic Büchi automata
• State of Büchi complementation

Cited in

(8)

• Unifying Büchi complementation constructions
• State of Büchi complementation
• Unifying Büchi complementation constructions
• Towards a grand unification of Büchi complementation constructions
• Complementing Büchi Automata with Ranker
• Modular mix-and-match complementation of Büchi automata
• Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
• Complementation of Emerson-Lei automata

Describes a project that uses

Uses Software

• NuSMV

This page was built for publication: On minimal odd rankings for Büchi complementation

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