Article

Free access

Algebraic decision diagrams and their applications

Authors:

Fabio SomenziAuthors Info & Claims

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

Pages 188 - 191

Published: 07 November 1993 Publication History

PDF eReader

References

[1]

R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation'), IEEE Transact~on~ on Compul;ers, Vol. C- 35, No. 8, pp. 79-85, Aug. 1986.

Digital Library

Google Scholar

[2]

O. Coudert) C. Berthet, J. C. Madre) "Verification of Sequential Machines Based on Symbolic Execution", LNCS, Vol. 407, pp. 365-373, 1989.

Digital Library

Google Scholar

[3]

H. Touati, H. Savo}, B. Lin) R. Brayton, A. Sangiovanni- Vincentelli, "Implicit Enumeration of Finite State Machines Using BDD's'), ICCA.D-90, pp. 130-133, Nov. 1990.

Google Scholar

[4]

H. Cho, G. D. Hachtel, S. W. Jeong, B. Plessier) E. Schwarz, F. Somenzi, "ATPG Aspects of FSM Verification", ICCAD-90) pp. 134-1373 Nov. 1990.

Google Scholar

[5]

J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, "Sequential Circuit Verification Using Symbolic Model Checking)'' DAC-90, pp. 46-51)Jun. 1990.

Digital Library

Google Scholar

[6]

H. Cho, G.D. Hachtel, E. Macii, B. Plessier, F. Somenzi, ~'Algorithms for Approximate FSM Tr~versal,), DAC-93, pp. 25-30, Jun. 1993.

Digital Library

Google Scholar

[7]

G. D. Hachtel, F. Somenzi, "A Symbolic Algorithm for Maximum Flow in 0-1 Networks'), ICCAD-93, Nov. 1993.

Digital Library

Google Scholar

[8]

E. M. Clarke, K. L. McMillan, X. Zhao, M. Fujita, J. Yang, '(Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping')) DAC-93, pp. 54-60, Jun. 1993.

Digital Library

Google Scholar

[9]

E. M. Clarke, M. Fujita, P. C. McGeer, K. McMillan, J. Young, "Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation'), ICCAD-93, Nov. 1993.

Google Scholar

[10]

F. M. Brown, Boolean Reasoning: The Logic o/ Boolean Equations, Kluwer Academic Publishers, 1990.

Google Scholar

[11]

G. Gustavson, "Efficient Algorithm to Perform Sparse Matrix Multiplication", IBM Technical Disclo.~ure Bulletin, Vol. 20, No. 3, pp. 1262-1264, Aug. 1977.

Google Scholar

[12]

I. S. Duff, A. M. t~risman, J. K. Reid, Direc~ Me~hods for Sparse Matrices, Clarendon Press, 1986.

Digital Library

Google Scholar

[13]

I. S. Duff, R. G. Grimes, J. G. Lewis, "Sparse Matrix Test Problems'), A CM Transaction8 on Mathematical Software) Vol. 15, pp. 1-14) 1989.

Digital Library

Google Scholar

[14]

S. Ross, A Fzrst Course zn Probability, Macmillan, 1988.

Google Scholar

[15]

I. Bahar, E. Frohm) C. Gaona) G. D. Hachtel, t~. Macii, A. Pardo, F. Somenzi, Algebrazc Decision Diagrams and their AppIzcation~) Internal Report) VLSI/CAD Research Group, Dept. of Electrical and Computer Engineering) University of Colorado at Boulder) Apr. 1993.

Digital Library

Google Scholar

Cited By

View all

Hillmich SZulehner AKueng RMarkov IWille R(2022)Approximating Decision Diagrams for Quantum Circuit SimulationACM Transactions on Quantum Computing10.1145/35307763:4(1-21)Online publication date: 27-Jul-2022
https://dl.acm.org/doi/10.1145/3530776
Giannarakis NSilva AWalker D(2021)ProbNV: probabilistic verification of network control planesProceedings of the ACM on Programming Languages10.1145/34735955:ICFP(1-30)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473595
Moreira DDelgado KNunes de Barros LAndre EKoenig SDastani MSukthankar G(2018)Symbolic Dynamic Programming for Risk-sensitive Markov Decision Process with limited budgetProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3238057(2019-2021)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3238057
Show More Cited By

Algebraic decision diagrams and their applications
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Enriching Diagrams with Algebraic Operations
Foundations of Software Science and Computation Structures
Abstract
In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad. Under the ...
Algebric Decision Diagrams and Their Applications

In this paper we present theory and experimental results on Algebraic Decision Diagrams. These diagrams extend BDDs by allowing values from an arbitrary finite domain to be associated with the terminal nodes of the diagram. We present a treatment founded ...
Constraint Diagrams: A Step Beyond UML
TOOLS '99: Proceedings of the Technology of Object-Oriented Languages and Systems

The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An exception to this is the Object Constraint Language (OCL) which is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

November 1993

781 pages

ISBN:0818644907

Chairmen:
Michael Lightner
Univ. of Colorado, Boulder
,
Jochen A. G. Jess
Eindhoven Univ. of Tech., Eindhoven, The Netherlands

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 07 November 1993

Check for updates

Qualifiers

Article

Conference

ICCAD '93

Sponsor:

SIGDA
IEEE-CS

ICCAD '93: International Conference on Computer Aided Design

November 7 - 11, 1993

California, Santa Clara, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

108
Total Citations
View Citations
876
Total Downloads

Downloads (Last 12 months)100
Downloads (Last 6 weeks)15

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hillmich SZulehner AKueng RMarkov IWille R(2022)Approximating Decision Diagrams for Quantum Circuit SimulationACM Transactions on Quantum Computing10.1145/35307763:4(1-21)Online publication date: 27-Jul-2022
https://dl.acm.org/doi/10.1145/3530776
Giannarakis NSilva AWalker D(2021)ProbNV: probabilistic verification of network control planesProceedings of the ACM on Programming Languages10.1145/34735955:ICFP(1-30)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473595
Moreira DDelgado KNunes de Barros LAndre EKoenig SDastani MSukthankar G(2018)Symbolic Dynamic Programming for Risk-sensitive Markov Decision Process with limited budgetProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3238057(2019-2021)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3238057
Dijk TPol J(2018)Multi-core symbolic bisimulation minimisationInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-017-0468-z20:2(157-177)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s10009-017-0468-z
Dijk TPol J(2017)SylvanInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0433-219:6(675-696)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s10009-016-0433-2
Shen YChoi ADarwiche A(2016)Tractable operations for arithmetic circuits of probabilistic modelsProceedings of the 30th International Conference on Neural Information Processing Systems10.5555/3157382.3157538(3943-3951)Online publication date: 5-Dec-2016
https://dl.acm.org/doi/10.5555/3157382.3157538
D'Antoni LVeanes MKoskinen EGrohe MShankar N(2016)Minimization of Symbolic Tree AutomataProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2933578(873-882)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2933578
Dijk TPol J(2016)Multi-core Symbolic Bisimulation MinimisationProceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 963610.1007/978-3-662-49674-9_19(332-348)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49674-9_19
Raghavan AKhardon RTadepalli PFern A(2015)Memory-efficient symbolic online planning for factored MDPsProceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence10.5555/3020847.3020923(732-741)Online publication date: 12-Jul-2015
https://dl.acm.org/doi/10.5555/3020847.3020923
McDonald CChou HDurairaj VLin PMarculescu DLiu F(2015)Efficient Transistor-Level Symbolic Timing Simulation Using Cached Partial Circuit StatesProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840931(802-807)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840931
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Enriching Diagrams with Algebraic Operations

Algebric Decision Diagrams and Their Applications

Constraint Diagrams: A Step Beyond UML