Decision and optimization problems in the Unreliable-Circuit Logic

The ambition constrained validity and the model witness problems in the logic UCL, for reasoning about circuits with unreliable gates, are analyzed. Moreover, two additional problems, motivated by the applications, are studied. One consists of finding bounds on the reliability rate of the gates that ensure that a given circuit has an intended success rate. The other consists of finding a reliability rate of the gates that maximizes the success rate of a given circuit. Sound and complete algorithms are developed for these problems and their computational complexity is studied.

[1]  S. H. Lee,et al.  Boolean functions over nano-fabrics: Improving resilience through coding , 2012, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[2]  Joseph Sifakis,et al.  Model checking , 1996, Handbook of Automated Reasoning.

[3]  Hao Chen,et al.  On the Reliability of Computational Structures Using Majority Logic , 2011, IEEE Transactions on Nanotechnology.

[4]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[5]  Cristina Sernadas,et al.  Craig Interpolation in the Presence of Unreliable Connectives , 2014, Logica Universalis.

[6]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[7]  A. Tarski A Decision Method for Elementary Algebra and Geometry , 2023 .

[8]  Cristina Sernadas,et al.  Approximate reasoning about logic circuits with single-fan-out unreliable gates , 2014, J. Log. Comput..

[9]  Beate Bollig Exponential space complexity for OBDD-based reachability analysis , 2010, Inf. Process. Lett..

[10]  Sanjukta Bhanja,et al.  Probabilistic Error Modeling for Nano-Domain Logic Circuits , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Steven Homer,et al.  Computability and Complexity Theory , 2001, Texts in Computer Science.

[12]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[13]  A. S. C. S. J. R. P. Mateus Non-deterministic combination of connectives , 2011 .