The Experts below are selected from a list of 327 Experts worldwide ranked by ideXlab platform
Sarma Sastry - One of the best experts on this subject based on the ideXlab platform.
-
DAC - Edge-valued Binary Decision diagrams for multi-level hierarchical verification
1992Co-Authors: Yung-te Lai, Sarma SastryAbstract:In this paper we present a new data structure called edge-valued Binary Decision diagrams (EV) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. We show that an EV is a compact and canonical representation for arbitrary integer functions. Hence the specification can be at a higher level than the implementation. Furthermore, the variable ordering strategy for an EV can be derived from a hi her level functional specification instead of the gate fevel specification. Examples shown in this paper includes SN74L85[7], SN74181 71, a 64built from SN74181.
-
edge valued Binary Decision diagrams for multi level hierarchical verification
Design Automation Conference, 1992Co-Authors: Yung-te Lai, Sarma SastryAbstract:In this paper we present a new data structure called edge-valued Binary Decision diagrams (EV) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. We show that an EV is a compact and canonical representation for arbitrary integer functions. Hence the specification can be at a higher level than the implementation. Furthermore, the variable ordering strategy for an EV can be derived from a hi her level functional specification instead of the gate fevel specification. Examples shown in this paper includes SN74L85[7], SN74181 71, a 64built from SN74181.
-
Edge-valued Binary Decision for multi-level hierarchical verification
[1992] Proceedings 29th ACM IEEE Design Automation Conference, 1Co-Authors: Yung-te Lai, Sarma SastryAbstract:The authors present a new data structure called edge-valued Binary Decision diagrams (EVs) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. It is shown that an EV is a compact and canonical representation for arbitrary integer functions. Hence, the specification can be at a higher level than the implementation. The variable ordering strategy for an EV can be derived from a higher-level functional specification instead of the gate-level specification. Examples of the design of a 64-b comparator and of a 64-b ripple-carry adder are included. >
Yung-te Lai - One of the best experts on this subject based on the ideXlab platform.
-
Formal verification using edge-valued Binary Decision diagrams
IEEE Transactions on Computers, 1996Co-Authors: Yung-te Lai, Massoud Pedram, Sarma VrudhulaAbstract:We present a new data structure called edge-valued Binary-Decision diagrams (EVBDD). An EVBDD is a directed acyclic graph, that provides a canonical and compact representation of functions that involve both Boolean and integer quantities. In general, EVBDDs provide a more versatile and powerful representation than ordinary Binary Decision diagrams. We first describe the structure and properties of EVBDDs, and present a general algorithm for performing a variety of Binary operations. Next, we describe an important extension of EVBDDs, called Structural EVBDDs, and show how they can be used for hierarchical verification.
-
Edge Valued Binary Decision Diagrams
Representations of Discrete Functions, 1996Co-Authors: Sarma Vrudhula, Massoud Pedram, Yung-te LaiAbstract:We describe a canonical and compact data structure, called Edge Valued Binary Decision Diagrams (EVBDD), for representing and manipulating pseudo Boolean functions (PBF). EVBDDs are particularly useful when both arithmetic and Boolean operations are required. We describe a general algorithm on EVBDDs for performing any Binary operation that is closed over the integers. Next, we discuss the relation between the probability expression of a Boolean function and its representation as a pseudo Boolean function. Utilizing this, we present algorithms for computing the probability spectrum and the Reed-Muller spectrum of a Boolean function directly on the EVBDD. Finally, we describe an extension of EVBDDs which associates both an additive and a multiplicative weight with the true edges of the function graph.
-
edge valued Binary Decision diagrams for multi level hierarchical verification
Design Automation Conference, 1992Co-Authors: Yung-te Lai, Sarma SastryAbstract:In this paper we present a new data structure called edge-valued Binary Decision diagrams (EV) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. We show that an EV is a compact and canonical representation for arbitrary integer functions. Hence the specification can be at a higher level than the implementation. Furthermore, the variable ordering strategy for an EV can be derived from a hi her level functional specification instead of the gate fevel specification. Examples shown in this paper includes SN74L85[7], SN74181 71, a 64built from SN74181.
-
DAC - Edge-valued Binary Decision diagrams for multi-level hierarchical verification
1992Co-Authors: Yung-te Lai, Sarma SastryAbstract:In this paper we present a new data structure called edge-valued Binary Decision diagrams (EV) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. We show that an EV is a compact and canonical representation for arbitrary integer functions. Hence the specification can be at a higher level than the implementation. Furthermore, the variable ordering strategy for an EV can be derived from a hi her level functional specification instead of the gate fevel specification. Examples shown in this paper includes SN74L85[7], SN74181 71, a 64built from SN74181.
-
Edge-valued Binary Decision for multi-level hierarchical verification
[1992] Proceedings 29th ACM IEEE Design Automation Conference, 1Co-Authors: Yung-te Lai, Sarma SastryAbstract:The authors present a new data structure called edge-valued Binary Decision diagrams (EVs) as a representation of functions. An EV is an extension of ordered Binary Decision diagrams that allows for multilevel and hierarchical verification. It is shown that an EV is a compact and canonical representation for arbitrary integer functions. Hence, the specification can be at a higher level than the implementation. The variable ordering strategy for an EV can be derived from a higher-level functional specification instead of the gate-level specification. Examples of the design of a 64-b comparator and of a 64-b ripple-carry adder are included. >
Toshihide Ibaraki - One of the best experts on this subject based on the ideXlab platform.
-
Reasoning with ordered Binary Decision diagrams
Discrete Applied Mathematics, 2004Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:AbstractWe consider problems of reasoning with a knowledge-base, which is represented by an ordered Binary Decision diagram, for two cases of general and Horn knowledge-bases. Our main results say that both finding a model of a knowledge-base and deducing from a knowledge-base can be done in linear time for a general knowledge-base, but that abduction is NP-complete even for a Horn knowledge-base. Then, we consider abduction when its assumption set consists of all propositional literals (i.e., an answer for a given query is allowed to include any positive literals), and show that it can be done in polynomial time if the knowledge-base is Horn, while it remains NP-complete for the general case. Some other solvable cases are also discussed
-
Ordered Binary Decision diagrams as knowledge-bases
Artificial Intelligence, 2002Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:AbstractWe consider the use of ordered Binary Decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations. We then present polynomial time algorithms for the two problems of testing whether a given OBDD represents a unate Boolean function, and of testing whether it represents a Horn function
-
ISAAC - Ordered Binary Decision Diagrams as Knowledge-Bases
Algorithms and Computation, 1999Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:We propose to make use of ordered Binary Decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations in the sense of space requirement. We then consider two recognition problems of OBDDs, and present polynomial time algorithms for testing whether a given OBDD represents a unate Boolean function, and whether it represents a Horn function.
Stephan Waack - One of the best experts on this subject based on the ideXlab platform.
-
Nondeterministic ordered Binary Decision diagrams with repeated tests and various modes of acceptance
Information Processing Letters, 2006Co-Authors: Henrik Brosenne, Matthias Homeister, Stephan WaackAbstract:Ordered Binary Decision diagrams with repeated tests are considered both in complexity theory and in applications. Bollig et al. have proved in [B. Bollig, M. Sauerhoff, D. Sieling, I. Wegener, Hierarchy theorems of kOBDDs and kIBDDs, Theoret. Comput. Sci. 205 (1998) 45-60] a tight hierarchy result for the classes of functions representable by k layers of polynomial-size deterministic ordered Binary Decision diagrams. In this paper the nondeterministic case is investigated, where the layers are driven by one and the same variable ordering. For k being a constant, it is shown that for the existential, the parity-, and the majority acceptance mode the analogous hierarchy collapses.
-
Quantum Ordered Binary Decision Diagrams with Repeated Tests
arXiv: Quantum Physics, 2005Co-Authors: Matthias Homeister, Stephan WaackAbstract:Quantum branching programs (quantum Binary Decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs have been considered, e. g. read--once quantum branching programs. This paper considers quantum ordered Binary Decision diagrams (QOBDDs) and answers the question: How does the computational power of QOBDDs increase, if we allow repeated tests. Additionally it is described how to synthesize QOBDDs according to Boolean operations.
Takashi Horiyama - One of the best experts on this subject based on the ideXlab platform.
-
Reasoning with ordered Binary Decision diagrams
Discrete Applied Mathematics, 2004Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:AbstractWe consider problems of reasoning with a knowledge-base, which is represented by an ordered Binary Decision diagram, for two cases of general and Horn knowledge-bases. Our main results say that both finding a model of a knowledge-base and deducing from a knowledge-base can be done in linear time for a general knowledge-base, but that abduction is NP-complete even for a Horn knowledge-base. Then, we consider abduction when its assumption set consists of all propositional literals (i.e., an answer for a given query is allowed to include any positive literals), and show that it can be done in polynomial time if the knowledge-base is Horn, while it remains NP-complete for the general case. Some other solvable cases are also discussed
-
Ordered Binary Decision diagrams as knowledge-bases
Artificial Intelligence, 2002Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:AbstractWe consider the use of ordered Binary Decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations. We then present polynomial time algorithms for the two problems of testing whether a given OBDD represents a unate Boolean function, and of testing whether it represents a Horn function
-
ISAAC - Ordered Binary Decision Diagrams as Knowledge-Bases
Algorithms and Computation, 1999Co-Authors: Takashi Horiyama, Toshihide IbarakiAbstract:We propose to make use of ordered Binary Decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations in the sense of space requirement. We then consider two recognition problems of OBDDs, and present polynomial time algorithms for testing whether a given OBDD represents a unate Boolean function, and whether it represents a Horn function.
