The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Binary Decision Diagrams
Abstract
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions involved. Methods are described for deriving these diagrams and examples are given for a number of basic combinational and sequential devices. Techniques are then outlined for using the diagrams to analyze the functions involved, for test generation, and for obtaining various implementations. It is shown that the diagrams are especially suited for processing by a computer. Finally, methods are described for introducing inversion and for directly "interconnecting" diagrams to define still larger functions. An example of the carry look-ahead adder is included.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Structural Models: An Introduction to the Theory of Directed Graphs.
Abelson, R. P., Harary, F., Norman, R. Z., & Cartwright, D. (1966) · Journal of the American Statistical Association · doi:10.2307/2282802 · Cited by 1,273
The Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 897
Wrench, J. W. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0400642-2 · Cited by 482
An Introduction to Computer Logic
Nagel, H., Irwin, J. D., & Carroll, B. D. (1974) · Prentice Hall PTR eBooks · Cited by 48
Cited by
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Symbolic Boolean manipulation with ordered binary-decision diagrams
Bryant, R. E. (1992) · ACM Computing Surveys · doi:10.1145/136035.136043 · Cited by 2,015
Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools
Ruijters, E., & Stoelinga, M. (2015) · Computer Science Review · doi:10.1016/j.cosrev.2015.03.001 · Cited by 847
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
Principles in the Evolutionary Design of Digital Circuits—Part II
Miller, J. F., Job, D., & Vassilev, V. K. (2000) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1010066330916 · Cited by 381
Metadata
- Authors
- Akers
- Venue
- IEEE Transactions on Computers
- Published
- 1978-06
- Volume
- C-27
- Issue
- 6
- Pages
- 509-516
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W1994143452
- Cited by
- 1,828
- References
- 4
- FWCI
- 3.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Binary Decision Diagrams. https://app.cochat.ai/papers/10.1109/tc.1978.1675141
- The paper
- Akers. (1978). Binary Decision Diagrams. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1978.1675141
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.