State of Büchi Complementation release_ki2cgwxoc5da5eyir6kr2dsuki

by Ming-Hsien Tsai, Seth Fogarty (Trinity University), Moshe Y. Vardi, Yih-Kuen Tsay (National Taiwan University)

Released as a article .

2014  

Abstract

Complementation of B\"uchi automata has been studied for over five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches. Regarding the performance of these approaches, there have been several complexity analyses but very few experimental results. What especially lacks is a comparative experiment on all of the four approaches to see how they perform in practice. In this paper, we review the four approaches, propose several optimization heuristics, and perform comparative experimentation on four representative constructions that are considered the most efficient in each approach. The experimental results show that (1) the determinization-based Safra-Piterman construction outperforms the other three in producing smaller complements and finishing more tasks in the allocated time and (2) the proposed heuristics substantially improve the Safra-Piterman and the slice-based constructions.
In text/plain format

Archived Files and Locations

application/pdf  324.4 kB
file_v7akxgwgfjcrxjgahuduz43vxi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2014-12-17
Version   v2
Language   en ?
arXiv  1406.4575v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 8366bd72-a719-4df3-aa9e-a9bbcee861ed
API URL: JSON