Tree: 42dc01a1b5

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '42dc01a1b5'

${ noResults }

Commit Graph

1 Commits (42dc01a1b5c49a5aa8079655386f165eee58e39e)

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.	6 years ago