You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Tree: e5fd6b4f73

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'e5fd6b4f73'

${ noResults }

prism-accumulation/prism-tests/functionality

History

Joachim Klein e5fd6b4f73 Use reachability reward computation for complex state formulas E.g., R=?[ F (a & A[F b])] was previously handled via co-safety, as the operand of the F operator is not a proposition.		8 years ago
..
export	Checking bounded properties (e.g. P>p[...]) fails if results are too inaccurate.	6 years ago
import	Explicit model import bugfix (when no .sta file is provided).	6 years ago
language	Consistently disallow infinite rates in CTMCs in symbolic/explicit engines.	6 years ago
testing	Enable (explicit engine) model checking of LTSs.	6 years ago
verify	Improve detection of infinite-valued states for POMDP expected reward.	6 years ago