Simplifying Alternating Automata for Emptiness Testing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU143337" target="_blank" >RIV/00216305:26230/21:PU143337 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-89051-3_14" target="_blank" >https://doi.org/10.1007/978-3-030-89051-3_14</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-89051-3_14" target="_blank" >10.1007/978-3-030-89051-3_14</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Simplifying Alternating Automata for Emptiness Testing

Popis výsledku v původním jazyce

We propose preprocessing techniques that improve efficiency of testing language emptiness of alternating automata. We target mainly automata that come from practical application such as processing regular expressions, LTL formulae, or string solving. Such automata often have large alphabets and transition relations represented by succinct and complex Boolean formulae that are more or less unrestricted and may even mix symbols with states. Our main contribution are simplification methods that can be seen as originating from a limited form of determinisation. Our transformations simplify the transition formulae and decrease the number of states. We evaluate experimentally that our preprocessing is beneficial when used together with most of the existing algorithms. It generally improves running times and allows to solve examples that could not be solved before within the given timeout.

Název v anglickém jazyce

Simplifying Alternating Automata for Emptiness Testing

Popis výsledku anglicky

We propose preprocessing techniques that improve efficiency of testing language emptiness of alternating automata. We target mainly automata that come from practical application such as processing regular expressions, LTL formulae, or string solving. Such automata often have large alphabets and transition relations represented by succinct and complex Boolean formulae that are more or less unrestricted and may even mix symbols with states. Our main contribution are simplification methods that can be seen as originating from a limited form of determinisation. Our transformations simplify the transition formulae and decrease the number of states. We evaluate experimentally that our preprocessing is beneficial when used together with most of the existing algorithms. It generally improves running times and allows to solve examples that could not be solved before within the given timeout.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA19-24397S" target="_blank" >GA19-24397S: Automaty v rozhodovacích procedurách a verifikaci</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings

ISBN

978-3-030-89051-3

ISSN

—

e-ISSN

—

Počet stran výsledku

22

Strana od-do

243-264

Název nakladatele

Springer International Publishing

Místo vydání

Cham

Místo konání akce

Chicago

Datum konání akce

17. 10. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000783821500014