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.
| Identifer | oai:union.ndltd.org:RICE/oai:scholarship.rice.edu:1911/61915 |
| Date | January 2009 |
| Contributors | Vardi, Moshe Y. |
| Source Sets | Rice University |
| Language | English |
| Detected Language | English |
| Type | Thesis, Text |
| Format | application/pdf |
Page generated in 0.0016 seconds