Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Abstract: In this paper we address the fault detection problem for Boolean control networks (BCNs), by resorting to the algebraic approach recently introduced by D. Cheng and co-authors. To this end, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results