Tree: fa612cb601

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'fa612cb601'

${ noResults }

Commit Graph

1 Commits (fa612cb601a3232aa60a6a4d5b9b53d76aba7c75)

Author	SHA1	Message	Date
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.	5 years ago
Dave Parker	99c06ba2d4	Move prism-tests into this repository and update Makefile "tests" target.	8 years ago