Application of a new logically complete ATMS to digraph and network-connectivity analysis

The binary decision diagram (BDD) and the metaproduct technologies have made possible to perform interactively exact qualitative and quantitative analysis of fault trees that could not previously be exactly analysed. This paper shows that these technologies can also be used to build an interactive tool to perform exact analysis of digraphs and of network connectivity problems. The paper also shows that the basic functionalities needed to perform these analyses are exactly those of an assumption-based truth maintenance system (ATMS), and it describes a new logically complete ATMS built using BDDs and metaproducts. The usefulness and the efficiency of this approach is demonstrated through the analysis of the feedwater system of a nuclear plant.<<ETX>>

[1]  Roy Billinton,et al.  Reliability Evaluation of Engineering Systems , 1983 .

[2]  Olivier Coudert,et al.  Fault tree analysis: 10/sup 20/ prime implicants and beyond , 1993, Annual Reliability and Maintainability Symposium 1993 Proceedings.

[3]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[4]  Olivier Coudert,et al.  A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver , 1991, IJCAI.

[5]  Marc Bouissou.  The FIGARO dependability evaluation workbench in use: Case studies for fault-tolerant computer systems , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[6]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[7]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[8]  Ivan J. Sacks.  Digraph Matrix Analysis , 1985, IEEE Transactions on Reliability.

[9]  Olivier Coudert,et al.  A new method to compute prime and essential prime implicants of Boolean functions , 1992 .

[10]  Olivier Coudert,et al.  Fault Tree Analysis: 1020 Prime Implicants and Beyond , 1993 .

[11]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[12]  D. L. Iverson.  Automatic translation of digraph to fault-tree models , 1992, Annual Reliability and Maintainability Symposium 1992 Proceedings.