Faculty of Information Technology, BUT

Publication Details

Lazy Automata Techniques for WS1S

FIEDOR Tomáš, HOLÍK Lukáš, JANKŮ Petr, LENGÁL Ondřej and VOJNAR Tomáš. Lazy Automata Techniques for WS1S. arXiv:1701.06282, 2017. Available from: https://arxiv.org/abs/1701.06282v2
Czech title
Líné Automatové Techniky pro WS1S
Type
technical report
Language
english
Authors
URL
Keywords
WS1S
finite automata
logic
antichains
lazy evaluation
subsumption
monadic second-order logic
Abstract
We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests whether its language is empty. The main novelty is to test the emptiness on the fly, while constructing the automaton, and prune the constructed state space from parts irrelevant for the test. The pruning is done by a~generalization of two techniques used in antichain-based language inclusion and universality checking of finite automata: subsumption and early termination. The~richer structure of the WS1S decision problem allows us, however, to elaborate on these techniques in novel ways. Our experiments show that the proposed approach can indeed significantly outperform the classical decision procedure (implemented in the \mona~tool) as well as its recently proposed alternative based on using nondeterministic automata.
Published
2017
Pages
17
Place
arXiv:1701.06282, US
BibTeX
@TECHREPORT{FITPUB11332,
   author = "Tom\'{a}\v{s} Fiedor and Luk\'{a}\v{s} Hol\'{i}k and Petr Jank\r{u} and Ond\v{r}ej Leng\'{a}l and Tom\'{a}\v{s} Vojnar",
   title = "Lazy Automata Techniques for WS1S",
   pages = 17,
   year = 2017,
   location = "arXiv:1701.06282, US",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/11332"
}
Back to top