Memory Efficient Calculation of Path Probabilities in Large Structured Markov Chains

Abstract

The problem we deal with is the analysis of a class of large structured Markov chains. In particular we assume that the whole state space can be partitioned into disjoint sets (called macro states) in which the process corresponds to the parallel execution of independent jobs. Petri nets and process algebras with phase type (PH) distributed execution times… (More)
DOI: 10.1109/QEST.2008.25

12 Figures and Tables

Topics

  • Presentations referencing similar topics