DeepAI AI Chat
Log In Sign Up

Automata Terms in a Lazy WSkS Decision Procedure (Technical Report)

by   Vojtech Havlena, et al.

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.


page 1

page 2

page 3

page 4


Incorporating Monitors in Reactive Synthesis without Paying the Price

Temporal synthesis attempts to construct reactive programs that satisfy ...

Zone-based verification of timed automata: extrapolations, simulations and what next?

Timed automata have been introduced by Rajeev Alur and David Dill in the...

State Space Reduction for Reachability Graph of CSM Automata

Classical CTL temporal logics are built over systems with interleaving m...

A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)

Case split is a core proof rule in current decision procedures for the t...

Knowledge Extraction and Knowledge Integration governed by Łukasiewicz Logics

The development of machine learning in particular and artificial intelli...

Ultimate TreeAutomizer (CHC-COMP Tool Description)

We present Ultimate TreeAutomizer, a solver for satisfiability of sets o...

Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)

This paper provides several optimizations of the rank-based approach for...