On the use of MTBDDs for performability analysis and verification of stochastic systems

@article{Hermanns2003OnTU,
  title={On the use of MTBDDs for performability analysis and verification of stochastic systems},
  author={H. Hermanns and M. Kwiatkowska and G. Norman and D. Parker and M. Siegle},
  journal={J. Log. Algebraic Methods Program.},
  year={2003},
  volume={56},
  pages={23-67}
}
  • H. Hermanns, M. Kwiatkowska, +2 authors M. Siegle
  • Published 2003
  • Computer Science
  • J. Log. Algebraic Methods Program.
  • This paper describes how to employ multi-terminal binary decision diagrams (MTBDDs) for the construction and analysis of a general class of models that exhibit stochastic, probabilistic and non-deterministic behaviour. It is shown how the notorious problem of state space explosion can be circumvented by compositionally constructing symbolic (i.e. MTBDD-based) representations of complex systems from small-scale components. We emphasise, however, that compactness of the representation can only be… CONTINUE READING
    85 Citations
    Symbolic Representations and Analysis of Large Probabilistic Systems
    • 69
    • PDF
    Model Checking Probabilistic Systems
    • PDF
    Symmetry Reduction for Probabilistic Model Checking
    • 158
    • PDF
    Partial Order Reduction for Markov Decision Processes: A Survey
    • 20
    CASPA: Symbolic model checking of stochastic systems
    • 6
    • PDF
    Advances in Symbolic Probabilistic Model Checking with PRISM
    • 16
    • PDF
    Model checking for performability
    • 20
    • PDF
    Symbolic Counterexample Generation for Discrete-Time Markov Chains
    • 10
    • PDF

    References

    SHOWING 1-10 OF 97 REFERENCES
    Faster and Symbolic CTMC Model Checking
    • 90
    • PDF
    Probabilistic symbolic model checking with PRISM: a hybrid approach
    • 347
    Generating BDDs for symbolic model checking in CCS
    • 47
    • PDF