stormpy.analysis¶
Graph and numerical analyses of probabilistic models.
Includes maximal end components, shortest paths, qualitative reachability, expected visiting times and steady-state distributions.
Functions
|
Compute the expected number of visits of each state, starting from the initial states. |
|
Compute the states satisfying a reachability or until property with probability 0 and with probability 1. |
|
Compute the steady-state (aka stationary) distribution. |
|
Compute the maximal end components of a nondeterministic sparse model. |
|
Compute the k-th most probable path from an initial state to a target. |
|
Sort the states of a sparse model topologically. |
Classes
Maximal end component |
|
Decomposition of maximal end components |
|
Entry of the shortest path tree: the k-th shortest path to a state via its predecessor and the path's probability |