4 articles for “BDD”

Set a search alert

Research ArticleOpen accessEvery word in the titleBDD Path Length Minimization Based on Initial Variable OrderingP. W.C. Prasad, M. Raseen, A. Assi, S. M.N.A. SenanayakeA large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,504 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsTest of a Data Basis Oriented Object after Phase of ConceptionSoumia Layachi, M. T. LaskriThe concepts of the approach object introduce cause a lot of interest and make a large topic of survey of it. These concepts applied to the data base are going to allow us to master the complexity of the data base and facilitate us their reuse. If one considers the conception of a data basis oriented object a lot of … …American Journal of Applied Sciences, Vol. 2, Issue 11 · 30 Nov 2005 · 6,719 accessesView PDF Cite

Research ArticleOpen accessIn the abstractReliability Evaluation of Distributed Computer Systems Subject to Imperfect Coverage and Dependent Common-Cause FailuresLiudong Xing, Akhilesh ShresthaImperfect coverage (IPC) occurs when a malicious component failure causes extensive damage due to inadequate fault detection, fault location or fault recovery. Common-cause failures (CCF) are multiple dependent component failures within a system due to a shared root cause. Both imperfect coverage and common-cause failures can exist in distributed computer systems and can contribute significantly to the overall system unreliability. … …Journal of Computer Science, Vol. 2, Issue 6 · 28 Sep 2006 · 6,838 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDF Cite