Tree: 2c4df3a20d

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '2c4df3a20d'

${ noResults }

Commit Graph

3 Commits (2c4df3a20dd17402ac1a93fa4bbbc2bce1fb83fb)

Author	SHA1	Message	Date
Dave Parker	7cb934427c	Consistently disallow infinite rates in CTMCs in symbolic/explicit engines. This disallows infinite probabilities too, but these would have already been caught elsewhere because the distribution would not sum to one.	6 years ago
Dave Parker	bfe888031e	Consistent treatment of illegal rewards in symbolic/explicit engines. Both types of engine now disallow negative/infinite/NaN rewards. Symbolic engines will mostly still not detect the presence of NaN due to the way that CUDD deals with this. Regression tests also added.	6 years ago
Dave Parker	99c06ba2d4	Move prism-tests into this repository and update Makefile "tests" target.	8 years ago