Probabilistic analysis of large finite state machines
- 1 January 1994
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 270-275
- https://doi.org/10.1145/196244.196374
Abstract
Regarding finite state machines as Markov chains facilitatesthe application of probabilistic methods to very largelogic synthesis and formal verification problems. Recently,we have shown how symbolic algorithms based on AlgebraicDecision Diagrams may be used to calculate the steadystateprobabilities of finite state machines with more than108states. These algorithms treated machines with stategraphs composed of a single terminal strongly connectedcomponent. In this paper we consider ...Keywords
This publication has 0 references indexed in Scilit: