Tree: 3fa0b761a5

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '3fa0b761a5'

${ noResults }

Commit Graph

1 Commits (3fa0b761a5dad7232ad66bb1a21f396d668e96ba)

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