Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fabio Somenzi  Home/Search
Context Related
| colorado.edu/~abel/p...markovtcad.ps.gz colorado.edu/persona...markovtcad.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: colorado.edu/~abel/p...markovtcad (more) From: colorado.edu/persona...markovtcad (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Regarding finite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verification problems. In this paper we present symbolic algorithms to compute the steady-state probabilities for very large finite state machines (up to 10 27 states). These algorithms, based on Algebraic Decision Diagrams (ADDs) --- an extension of BDDs that allows arbitrary values to be associated with the terminal nodes of the diagrams ---... (Update)
Cited by: More
ProbVerus: Probabilistic Symbolic Model Checking - Hartonas-Garmhausen, Campos.. (1999) (Correct)
Power Simulation and Estimation in VLSI Circuits - Pedram (1999) (Correct)
High-Level Power Modeling, Estimation, and Optimization - Macii, Pedram, Somenzi (1997) (Correct)
Similar documents (at the sentence level):
21.0%: Probabilistic Analysis of Large Finite State Machines - Hachtel, Macii, Pardo, Somenzi (1994) (Correct)
Active bibliography (related documents): More All
0.5: Reasoning about Infinite Computations - Vardi, Wolper (1994) (Correct)
0.3: Algebraic Decision Diagrams and their Applications - Bahar, Frohm, Gaona.. (1993) (Correct)
0.3: An ADD-Based Algorithm for Shortest Path.. - Bahar, Hachtel.. (1994) (Correct)
Similar documents based on text: More All
0.4: Automatic Abstraction Techniques For Formal Verification Of.. - Sánchez (1997) (Correct)
0.3: VIS: A System for Verification and Synthesis - Brayton.. (1996) (Correct)
0.2: An Application of ADD-Based Timing Analysis to.. - Iris Bahar Hyunwoo (1994) (Correct)
Related documents from co-citation: More All
31: Graph-based algorithms for boolean function manipulation - Bryant - 1986
26: Algebraic decision diagrams and their applications - Bahar, Frohm et al. - 1993
21: Introduction to the numerical solution of Markov chains (context) - Stewart - 1994
BibTeX entry: (Update)
G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovian analysis of large finite state machines. IEEE Transactions on Computer-Aided Design, 15(12):1479--1493, December 1996. http://citeseer.ist.psu.edu/hachtel96markovian.html More
@misc{ hachtel96markovian,
author = "G. Hachtel and E. Macii and A. Pardo and F. Somenzi",
title = "Markovian analysis of large finite state machines",
text = "G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovian analysis of
large finite state machines. IEEE Transactions on Computer-Aided Design,
15(12):1479--1493, December 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/hachtel96markovian.html" }
Citations (may not include all citations):1749 An Introduction to Probability Theory and its Applications (context) - Feller - 1968
744 Matrix computations (context) - Golub, Van Loan - 1989
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1994
181 Algebraic Decision Diagrams and their Applications - Bahar, Frohm et al. - 1993
181 Algebraic Decision Diagrams and their Applications - Bahar, Frohm et al. - 1993
143 Sequential Circuit Verification Using Symbolic Model Checkin.. (context) - Burch, Clarke et al. - 1990
112 and Computer Science Applications (context) - Trivedi, Statistics et al. - 1982
91 Verification of Sequential Machines Using Boolean Functional.. (context) - Coudert, Berthet et al. - 1989
87 Verification of Arithmetic Functions with Binary Moment Diag.. - Bryant, Chen - 1994
77 A Unified Framework for the Formal Verification of Sequentia.. (context) - Coudert, Madre - 1990
60 Multi-Terminal Binary Decision Diagrams: An Efficient Data S.. (context) - Clarke, Fujita et al. - 1993
60 Decomposability: Queueing and Computer System Applications (context) - Courtois - 1977
58 Representing Circuits More Efficiently in Symbolic Model Che.. (context) - Burch, Clarke et al. - 1991
45 Stochastic Processes (context) - Parzen - 1962
33 Re-Encoding Sequential Circuits to Reduce Power Dissipation (context) - Hachtel, Hermida et al. - 1994
29 ATPG Aspects of FSM Verification (context) - Cho, Hachtel et al. - 1990
28 Algorithms for Approximate FSM Traversal (context) - Cho, Hachtel et al. - 1993
27 Implicit Enumeration of Finite State Machines Using BDDs (context) - Touati, Savoj et al. - 1990
26 EVBDD-Based Algorithms for Integer Linear Programming, Spect.. (context) - Lai, Pedram et al. - 1994
18 Numerical Solutions of Markov Chains (context) - editor - 1991
18 Synchronizing Sequences and Symbolic Traversal Techniques in.. (context) - Cho, Jeong et al. - 1993
15 A Theory and Implementation of Sequential Hardware Equivalen.. (context) - Pixley - 1992
13 Van Nostrand Company (context) - Kemeny, Snell et al. - 1960
11 On Computing the Transitive Closure of a State Transition Re.. (context) - Matsunaga, McGeer et al. - 1993
6 Discrete Markov Chains (context) - Romanovsky - 1949
4 A Symbolic Algorithm for Maximum Flow in 0-1 Networks (context) - Hachtel, Somenzi - 1993
2 Theories of Automata on !-Tapes: A Simplified Approach (context) - Choueka - 1974
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC