TY  - JOUR
A1  - Breitenreiter, Anselm
A1  - Andjelković, Marko
A1  - Schrape, Oliver
A1  - Krstić, Miloš
T1  - Fast error propagation probability estimates by answer set programming and approximate model counting
JF  - IEEE Access
N2  - We present a method employing Answer Set Programming in combination with Approximate Model Counting for fast and accurate calculation of error propagation probabilities in digital circuits. By an efficient problem encoding, we achieve an input data format similar to a Verilog netlist so that extensive preprocessing is avoided. By a tight interconnection of our application with the underlying solver, we avoid iterating over fault sites and reduce calls to the solver. Several circuits were analyzed with varying numbers of considered cycles and different degrees of approximation. Our experiments show, that the runtime can be reduced by approximation by a factor of 91, whereas the error compared to the exact result is below 1%.
KW  - Circuit faults
KW  - Integrated circuit modeling
KW  - Programming
KW  - Analytical models
KW  - Search problems
KW  - Flip-flops
KW  - Encoding
KW  - Answer set programming
KW  - approximate model counting
KW  - error propagation
KW  - radhard design
KW  - reliability analysis
KW  - selective fault tolerance
KW  - single event upsets
Y1  - 2022
U6  - https://doi.org/10.1109/ACCESS.2022.3174564
SN  - 2169-3536
VL  - 10
SP  - 51814
EP  - 51825
PB  - Inst. of Electr. and Electronics Engineers
CY  - Piscataway
ER  -