Simplifying Alternating Automata for Emptiness Testing
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Simplifying Alternating Automata for Emptiness Testing
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA19-24397S" target="_blank" >GA19-24397S: Automata for Decision Procedures and Verification</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
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
—
Number of pages
22
Pages from-to
243-264
Publisher name
Springer International Publishing
Place of publication
Cham
Event location
Chicago
Event date
Oct 17, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000783821500014