Corpus ID: 7679190

Application of a New Logically CompleteATMS to Digraph and Network Connectivity

@inproceedings{AnalysisOlivier2007ApplicationOA,
  title={Application of a New Logically CompleteATMS to Digraph and Network Connectivity},
  author={AnalysisOlivier and Coudert},
  year={2007}
}
  • AnalysisOlivier, Coudert
  • Published 2007
SUMMARY & CONCLUSIONS 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 analysis are exactly… Expand

References

SHOWING 1-10 OF 14 REFERENCES
Digraph Matrix Analysis
  • I. Sacks
  • Computer Science
  • IEEE Transactions on Reliability
  • 1985
  • 29
  • Highly Influential
Automatic translation of digraph to fault-tree models
  • D. Iverson
  • Computer Science
  • Annual Reliability and Maintainability Symposium 1992 Proceedings
  • 1992
  • 21
  • PDF
An Assumption-Based TMS
  • J. Kleer
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1986
  • 1,858
  • PDF
Implicit and incremental computation of primes and essential primes of Boolean functions
  • O. Coudert, J. Madre
  • Computer Science
  • [1992] Proceedings 29th ACM/IEEE Design Automation Conference
  • 1992
  • 182
  • PDF
The FIGARO dependability evaluation workbench in use: Case studies for fault-tolerant computer systems
  • M. Bouissou
  • Engineering, Computer Science
  • FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing
  • 1993
  • 14
Fault Tree Analysis: 1020 Prime Implicants and Beyond", in Proc. of the ARMS, pp. 240{245
  • Atlanta GA,
  • 1993
Proc. of the ARMS
  • Proc. of the ARMS
  • 1993
...
1
2
...