Tree: 4780e3aa38

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '4780e3aa38'

${ noResults }

Commit Graph

4 Commits (4780e3aa3844edbac43c463bbbf9d3e3ac99a14c)

Author	SHA1	Message	Date
Steffen Märcker	5898c55afe	Improve implementations of DTMC::vmMult - scope of variables and naming - usage of Arrays#fill instead of manual loop for array initialisation - superflous casts	8 years ago
Steffen Märcker	76ab6e2d76	Add preprocessing for steady-state in explicit engine To guarantee convergence, the power method requires the precomputation P = (Q * deltaT + I) from: William J. Stewart: Introduction to the Numerical Solution of Markov Chains p. 124.	8 years ago
Steffen Märcker	a27e761070	Implement optimized #forEachTransition in DTMCSparse	8 years ago
Joachim Klein	7ac2b39ca6	explicit.DTMCSparse: sparse storage variant for DTMCs [with Steffen Maercker] adapted from MDPSparse git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@12144 bbc10eb1-c90d-0410-af57-cb519fbb1720	9 years ago