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.
 
 
 
 
dehnert db6f43ed9d made LRA computation for deterministic systems able to respect that the underlying solver requires a fixed-point formulation 8 years ago
..
ctmc test cases for ctmcs and markov automata 8 years ago
dft made LRA computation for deterministic systems able to respect that the underlying solver requires a fixed-point formulation 8 years ago
dtmc Tests for DRN parser 9 years ago
lab parsing choice labels for explicit models 9 years ago
ma minor fixes to let the total reward tests compile and pass 8 years ago
mdp fixes github issue #24 related to MEC decomposition 8 years ago
pdtmc made LRA computation for deterministic systems able to respect that the underlying solver requires a fixed-point formulation 8 years ago
pmdp more tests on pmdps and fixes 10 years ago
prctl tests for step bounded properties 10 years ago
rew Set correct example path for tests 10 years ago
tra Set correct example path for tests 10 years ago
txt made LRA computation for deterministic systems able to respect that the underlying solver requires a fixed-point formulation 8 years ago