Buchi containment and size-change termination

Files in this item

Files Size Format View
1466776.PDF 5.244Mb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Buchi containment and size-change termination
Author: Fogarty, Seth
Advisor: Vardi, Moshe Y.
Degree: Master of Science thesis
Abstract: We compare tools for complementing nondeterministic Buchi automata with a recent termination-analysis algorithm. Complementation of Buchi automata is a well-explored problem in program verification. Early solutions using a Ramsey-based combinatorial argument have been supplanted by rank-based constructions with exponentially better bounds. In 2001 Lee et al. presented the size-change termination (SCT) problem, along with both a reduction to Buchi automata and a Ramsey-based algorithm This algorithm strongly resembles the initial complementation constructions for Buchi automata. This leads us to wonder if theoretical gains in efficiency are mirrored in empirical performance. We prove the SCT algorithm is a specialized realization of the Ramsey-based complementation construction. Doing so allows us to generalize SCT solvers to handle Buchi automata. We experimentally demonstrate that, surprisingly, Ramsey-based approaches are superior over the domain of SCT problems, while rank-based approaches dominate automata universality tests. This reveals several interesting properties of the problem spaces and both approaches.
Citation: Fogarty, Seth. (2009) "Buchi containment and size-change termination." Masters Thesis, Rice University.
Date: 2009

This item appears in the following Collection(s)