Automata Terms in a Lazy WSkS Decision Procedure
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU142934" target="_blank" >RIV/00216305:26230/21:PU142934 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/12557/" target="_blank" >https://www.fit.vut.cz/research/publication/12557/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10817-021-09597-w" target="_blank" >10.1007/s10817-021-09597-w</a>
Alternative languages
Result language
angličtina
Original language name
Automata Terms in a Lazy WSkS Decision Procedure
Original language description
We propose a lazy decision procedure for the logic WSkS. It builds a term-based symbolic representation of the state space of the tree automaton (TA) constructed by the classical WSkS decision procedure. The classical decision procedure transforms the symbolic representation into a TA via a bottom-up traversal and then tests its language non-emptiness, which corresponds to satisfiability of the formula. On the other hand, we start evaluating the representation from the top, construct the state space on the fly, and utilize opportunities to prune away parts of the state space irrelevant to the language emptiness test. In order to do so, we needed to extend the notion of language terms (denoting language derivatives) used in our previous procedure for the linear fragment of the logic (the so-called WS1S) into automata terms. We implemented our decision procedure and identified classes of formulae on which our prototype implementation is significantly faster than the classical procedure implemented in the MONA tool.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
Name of the periodical
JOURNAL OF AUTOMATED REASONING
ISSN
0168-7433
e-ISSN
1573-0670
Volume of the periodical
65
Issue of the periodical within the volume
7
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
29
Pages from-to
971-999
UT code for WoS article
000680802300001
EID of the result in the Scopus database
2-s2.0-85111817441