Lazy Automata Techniques for WS1S

Lazy Automata Techniques for WS1S

Paper in proceedings (conference paper)

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.

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.

WS1S
finite automata
logic
antichains
lazy evaluation
subsumption
monadic second-order logic

WS1S
finite automata
logic
antichains
lazy evaluation
subsumption
monadic second-order logic

FIEDOR, T.; HOLÍK, L.; JANKŮ, P.; LENGÁL, O.; VOJNAR, T.

2018

17.01.2017

Springer Verlag

Heidelberg

978-3-662-54576-8

Proceedings of TACAS'17

Lecture Notes in Computer Science

0302-9743

Lecture Notes in Computer Science

10205

1

Federal Republic of Germany

407

425

18

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

04-TACAS17