Automata Terms in a Lazy WSkS Decision Procedure

Kód výsledku v IS VaVaI

RIV/00216305:26230/21:PU142934 - isvavai.cz

Výsledek na webu

https://www.fit.vut.cz/research/publication/12557/

DOI - Digital Object Identifier

10.1007/s10817-021-09597-w

Jazyk výsledku

angličtina

Název v původním jazyce

Automata Terms in a Lazy WSkS Decision Procedure

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Automata Terms in a Lazy WSkS Decision Procedure

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

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 periodika

JOURNAL OF AUTOMATED REASONING

ISSN

0168-7433

e-ISSN

1573-0670

Svazek periodika

65

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

29

Strana od-do

971-999

Kód UT WoS článku

000680802300001

EID výsledku v databázi Scopus

2-s2.0-85111817441