Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata

Simple item page
dc.citation.articleNumber114650en_US
dc.citation.journalTitleTheoretical Computer Scienceen_US
dc.citation.volumeNumber1006en_US
dc.contributor.authorLi, Yongen_US
dc.contributor.authorSchewe, Svenen_US
dc.contributor.authorVardi, Moshe Y.en_US
dc.date.accessioned2024-10-08T13:27:47Zen_US
dc.date.available2024-10-08T13:27:47Zen_US
dc.date.issued2024en_US
dc.description.abstractWe introduce a method for translating an alternating weak Büchi automaton (AWA), which corresponds to a Linear Dynamic Logic (LDL) formula, to an unambiguous Büchi automaton (UBA). Our translations generalize constructions for Linear Temporal Logic (LTL), a less expressive specification language than LDL. In classical constructions, LTL formulas are first translated to alternating very weak Büchi automata (AVAs)—automata that have only singleton strongly connected components (SCCs); these AVAs are then handled by efficient disambiguation procedures. However, general AWAs can have larger SCCs, which complicates disambiguation. Currently, the only available disambiguation procedure has to go through an intermediate construction of nondeterministic Büchi automata (NBAs), which would incur an exponential blow-up of its own. We introduce a translation from general AWAs to UBAs with a singly exponential blow-up, which also immediately provides a singly exponential translation from LDL to UBAs. Interestingly, the complexity of our translation is smaller than the best known disambiguation algorithm for NBAs (broadly (0.53n)n vs. (0.76n)n), while the input of our construction can be exponentially more succinct.en_US
dc.identifier.citationLi, Y., Schewe, S., & Vardi, M. Y. (2024). Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata. Theoretical Computer Science, 1006, 114650. https://doi.org/10.1016/j.tcs.2024.114650en_US
dc.identifier.digital1-s2-0-S0304397524002676-mainen_US
dc.identifier.doihttps://doi.org/10.1016/j.tcs.2024.114650en_US
dc.identifier.urihttps://hdl.handle.net/1911/117908en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsExcept where otherwise noted, this work is licensed under a Creative Commons Attribution (CC BY) license. Permission to reuse, publish, or reproduce the work beyond the terms of the license or beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.titleSingly exponential translation of alternating weak Büchi automata to unambiguous Büchi automataen_US
dc.typeJournal articleen_US
dc.type.dcmiTexten_US
dc.type.publicationpublisher versionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1-s2-0-S0304397524002676-main.pdf
Size:
801.04 KB
Format:
Adobe Portable Document Format
Download
Collections
Faculty Publications
Computer Science Publications