Output details
11 - Computer Science and Informatics
University of Liverpool
Return to search
Output 0 of 0 in the submission
Output title
Büchi Complementation Made Tight
Type
E - Conference contribution
Name of conference/published proceedings
International Symposium on Theoretical Aspects of Computer Science
Volume number
-
Issue number
-
First page of article
661
ISSN of proceedings
-
Year of publication
2009
Number of additional authors
0
Additional information
<10>Buechi Complementation is a fundamental problem in verification and synthesis. Vardi has given a series of keynote presentations on half a century of research in the area (eg., STACS 2007). Fogaty, Kupferman, Wilke, and Vardi (LMCS 2013) describe the contribution of this paper as follows: "The most notable improvements [to understanding the blow-up of Buechi complementation] are the introduction of tight rankings [FKV 2006] and Schewe’s improved cut-point construction [Sch09]." Our algorithm is implemented in the tools developed in Tsay's group at the National Taiwan university (STTT 2013, TACAS 2011, CIAA 2010).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
9
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
