Interface | Description |
---|---|
FinalPaths |
Interface for the storage transitions within and going-out of a state-set
Transitions can be represented in multiple ways (e.g. |
Class | Description |
---|---|
AbstractStateSet |
Abstract class enclosing a state-set
State-sets can be implemented in multiple ways (e.g. |
ApproximateFinalPaths |
Approximate representation of the probabilities of the transitions within and going out of a cycle.
Useful when assuming that the transitions to the states out of a cycle are equiprobable (Uniform transitions). |
CompactStateSet |
Representation of a state-set recurring to a compact set of patterns defining the internal states
|
CycleGraph |
Class with functionalities to explore a cycle of states
|
Dictionary |
Class responsible for the efficient calculus of the hash code of a given state
|
ExhaustiveFinalPaths |
Exhaustive representation of the probabilities of the transitions within and going out of a cycle
|
MDDStateSet |
Default representation of a state-set recurring to a hash-map of states
States are efficiently stored and accessed using minimal keys |
Result | |
State | |
StateSet |
Default representation of a state-set recurring to a hash-map of states
States are efficiently stored and accessed using minimal keys |
Copyright © 2005–2020. All rights reserved.