New Optimizations and Heuristics for Determinization of Büchi Automata

New Optimizations and Heuristics for Determinization of Büchi Automata

In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization procedure. We built a prototype implementation where all the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2019-11
Hauptverfasser: Löding, Christof, Pirogov, Anton
Format: Artikel
Sprache:eng
Schlagworte:
Heuristic
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Löding, Christof
Pirogov, Anton
description In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization procedure. We built a prototype implementation where all the presented heuristics can be freely combined and evaluated them, comparing our implementation with the state-of-the-art tool spot on multiple data sets with different characteristics. Our results show that the proposed optimizations and heuristics can in some cases significantly decrease the size of the resulting deterministic automaton.
doi_str_mv 10.48550/arxiv.1911.01759
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2312399188</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2312399188</sourcerecordid><originalsourceid>FETCH-proquest_journals_23123991883</originalsourceid><addsrcrecordid>eNqNyjsOgjAAgOHGxESiHMCtiTPYBxU6-mbSxZ00WGKJUOxDjWdz82I6cACnf_g_AKYYxUnGGJoL81T3GHOMY4RTxgcgIJTiKEsIGYHQ2hohRBYpYYwGYH-QD3jsnGrUSzilWwtFe4a59EZZp0oLK23gRjppGtX2BuoKrj7v8qLg0jvdCCcmYFiJq5Vh3zGY7bandR51Rt-8tK6otTftbxWEYkI5x1lG_1Nfd-9C2g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2312399188</pqid></control><display><type>article</type><title>New Optimizations and Heuristics for Determinization of Büchi Automata</title><source>Free E- Journals</source><creator>Löding, Christof ; Pirogov, Anton</creator><creatorcontrib>Löding, Christof ; Pirogov, Anton</creatorcontrib><description>In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization procedure. We built a prototype implementation where all the presented heuristics can be freely combined and evaluated them, comparing our implementation with the state-of-the-art tool spot on multiple data sets with different characteristics. Our results show that the proposed optimizations and heuristics can in some cases significantly decrease the size of the resulting deterministic automaton.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1911.01759</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Heuristic</subject><ispartof>arXiv.org, 2019-11</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784,27925</link.rule.ids></links><search><creatorcontrib>Löding, Christof</creatorcontrib><creatorcontrib>Pirogov, Anton</creatorcontrib><title>New Optimizations and Heuristics for Determinization of Büchi Automata</title><title>arXiv.org</title><description>In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization procedure. We built a prototype implementation where all the presented heuristics can be freely combined and evaluated them, comparing our implementation with the state-of-the-art tool spot on multiple data sets with different characteristics. Our results show that the proposed optimizations and heuristics can in some cases significantly decrease the size of the resulting deterministic automaton.</description><subject>Heuristic</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyjsOgjAAgOHGxESiHMCtiTPYBxU6-mbSxZ00WGKJUOxDjWdz82I6cACnf_g_AKYYxUnGGJoL81T3GHOMY4RTxgcgIJTiKEsIGYHQ2hohRBYpYYwGYH-QD3jsnGrUSzilWwtFe4a59EZZp0oLK23gRjppGtX2BuoKrj7v8qLg0jvdCCcmYFiJq5Vh3zGY7bandR51Rt-8tK6otTftbxWEYkI5x1lG_1Nfd-9C2g</recordid><startdate>20191105</startdate><enddate>20191105</enddate><creator>Löding, Christof</creator><creator>Pirogov, Anton</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20191105</creationdate><title>New Optimizations and Heuristics for Determinization of Büchi Automata</title><author>Löding, Christof ; Pirogov, Anton</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_23123991883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Heuristic</topic><toplevel>online_resources</toplevel><creatorcontrib>Löding, Christof</creatorcontrib><creatorcontrib>Pirogov, Anton</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Löding, Christof</au><au>Pirogov, Anton</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>New Optimizations and Heuristics for Determinization of Büchi Automata</atitle><jtitle>arXiv.org</jtitle><date>2019-11-05</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>In this work, we present multiple new optimizations and heuristics for the determinization of B\"uchi automata that exploit a number of semantic and structural properties, most of which may be applied together with any determinization procedure. We built a prototype implementation where all the presented heuristics can be freely combined and evaluated them, comparing our implementation with the state-of-the-art tool spot on multiple data sets with different characteristics. Our results show that the proposed optimizations and heuristics can in some cases significantly decrease the size of the resulting deterministic automaton.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1911.01759</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2019-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2312399188
source Free E- Journals
subjects Heuristic
title New Optimizations and Heuristics for Determinization of Büchi Automata
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A27%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=New%20Optimizations%20and%20Heuristics%20for%20Determinization%20of%20B%C3%BCchi%20Automata&rft.jtitle=arXiv.org&rft.au=L%C3%B6ding,%20Christof&rft.date=2019-11-05&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1911.01759&rft_dat=%3Cproquest%3E2312399188%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2312399188&rft_id=info:pmid/&rfr_iscdi=true