On the Representation of Probabilities over Structured Domains (1999) [25 citations — 0 self]
Abstract:
Abstract. In this paper we extend one of the main tools used in verification of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. We show how probabilistic vectors and matrices can be represented canonically and succinctly using probabilistic trees and graphs, and how simulation of large-scale probabilistic systems can be performed. We consider this work as an important contribution of the verification community to numerous domains which need to manipulate very large matrices. 1
Citations
| 4388 | Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference – Pearl - 1988 |
| 2317 | Graph-Based Algorithms for Boolean Function Manipulation – Bryant - 1986 |
| 583 | An Introduction to Bayesian Networks – Jensen - 1996 |
| 433 | Symbolic Model Checking: An Approach to the State Explosion Problem – McMillan - 1993 |
| 121 | Decision theoretic planning: structural assumptions and computational leverage – Boutilier, Dean, et al. - 1999 |
| 70 | Symbolic model checking – Burch, Clarke, et al. - 1992 |
| 8 | Factored Edge-Valued Binary Decision Diagrams – Tafertshofer, Pedram - 1997 |
| 6 | Decision Theoretic Planning – Dean, Kanazawa, et al. - 1999 |
| 4 | Multi-terminal binary decision diagrams: An e cient data structure for matrix representation – Clarke, Fujita, et al. - 1993 |

