Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits

no code implementations • 4 Oct 2022 • Alexander Semenov, Konstantin Chukharev, Egor Tarasov, Daniil Chivilikhin, Viktor Kondratiev

We show that the hardness of SAT encodings for LEC instances can be estimated \textit{w. r. t.}

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver

1 code implementation • 7 Jul 2019 • Konstantin Chukharev, Daniil Chivilikhin

We also present the developed tool fbSAT which implements the proposed method, and evaluate it in two case studies: inference of a finite-state model of a Pick-and-Place manipulator, and reconstruction of randomly generated automata.

Formal Languages and Automata Theory