most citedEstimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2019

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

Konstantin Chukharev, Daniil Chivilikhin

Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence,…