TimQu
|
9e2dcca5ee
|
extended/improved parsing reward bounded formulas to be compatible with the prism syntax
|
8 years ago |
|
TimQu
|
d9e62a66cc
|
cdf export for single objective formulas
|
8 years ago |
dehnert
|
8e3e99c4ce
|
fixed bug in submatrix computation pointed out by Timo Gros
|
8 years ago |
|
dehnert
|
b110172b0d
|
fixed bug in MaxSMT-based counterexample generation pointed out by Milan Ceska
|
8 years ago |
|
dehnert
|
ce5c740c51
|
resolved ambiguity to make gcc happy
|
8 years ago |
|
dehnert
|
a072ef5310
|
some fixes to handle large parameters
|
8 years ago |
|
dehnert
|
ac759d2671
|
minor performance improvements to model building
|
8 years ago |
|
dehnert
|
6501fffac3
|
several optimizations related to explicit model building
|
8 years ago |
sjunges
|
12dda40919
|
split IOSettings in BuildSettings and IOSettings, refactored some dependencies on settings object away if it doesnt hurt too much, moved GSPN and PGCL settings to their own libs
|
8 years ago |
|
dehnert
|
8116b360ba
|
changed hash function of bit vector hash map
|
8 years ago |
|
dehnert
|
3a11914da0
|
commit to switch workplace
|
8 years ago |
|
dehnert
|
f772af6241
|
fixed bug in bit vector hash map
|
8 years ago |
|
dehnert
|
db7d058800
|
converted some assertions into exceptions in bit vector hash map
|
8 years ago |
|
dehnert
|
b99bc59215
|
adding some primes
|
8 years ago |
|
dehnert
|
41bc2c0de4
|
explicit instantiations to make gcc hapy
|
8 years ago |
Tom Janson
|
374f7e1fbb
|
kSP: disallow access to index 0 (1-based indices!)
|
8 years ago |
|
TimQu
|
c9beea4f33
|
better lower/upper result bounds
|
8 years ago |
|
TimQu
|
746a58ff12
|
better statistics output
|
8 years ago |
|
TimQu
|
86253fe88a
|
moved multidimensional unfolding implementation from multiobjective into helper namespace
|
8 years ago |
|
TimQu
|
17d6835477
|
removed acyclic minmax method as it is not much better then gauss-seidel style multiplications
|
8 years ago |
|
TimQu
|
d85a845b7d
|
Fixed cases where a solver guarantee was not established although it was needed by the termination condition
|
8 years ago |
|
TimQu
|
117d1b5c99
|
clean up single objective reward bounded case
|
8 years ago |
|
TimQu
|
016fedd58e
|
Better progress info
|
8 years ago |
|
dehnert
|
e6f61fb441
|
fixed bug in hybrid engine when using interval iteration
|
8 years ago |
|
TimQu
|
3571f0ddca
|
Respected that the solution is unique when doing value iteration
|
8 years ago |
|
TimQu
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
8 years ago |
|
dehnert
|
4e4526182f
|
adding information about which technique is used to symbolic native linear equation solver
|
8 years ago |
|
dehnert
|
b8120ed73a
|
Markov automaton model checker now clearing basic requirements
|
8 years ago |
|
TimQu
|
3215f25513
|
upper result bounds for cumulative reward formulas to enable interval iteration
|
8 years ago |
|
TimQu
|
d91d979d90
|
changed some output
|
8 years ago |
|
dehnert
|
d90c507431
|
fixed bug in sparse bisimulation quotient extraction related to rewards
|
8 years ago |
|
TimQu
|
70dc9ce7ac
|
Bypassing requirements check to make value iteration without a lower result bound work
|
8 years ago |
|
TimQu
|
e3a506ecc6
|
Property information output
|
8 years ago |
|
dehnert
|
34485836b8
|
fixed some convertNumber applications
|
8 years ago |
Matthias Volk
|
f47e40d363
|
Fixed removed variable
|
8 years ago |
|
dehnert
|
4d7770aea6
|
fixed issue in hybrid reachability reward computation that caused empty row groups
|
8 years ago |
|
dehnert
|
3185719fe5
|
fix for linking issue under linux, adding missing l3pp dependency l3pp_ext
|
8 years ago |
|
dehnert
|
c0f07557ed
|
simplified state signature computation in dd-based bisimulation
|
8 years ago |
|
dehnert
|
29b915ccbf
|
fix out-of-index write in bisimulation quotienting
|
8 years ago |
|
TimQu
|
4cadc61f19
|
less searches for epoch solutions
|
8 years ago |
|
dehnert
|
0ef06fd31b
|
re-add time output to storm output and make iterative minmax solver respect linear equation solver format for policy iteration
|
8 years ago |
|
TimQu
|
b56cd07d0e
|
Consider only a submap of all epochsolutions for faster search
|
8 years ago |
|
TimQu
|
5c1de03d14
|
fixed min prob computation for single objective case
|
8 years ago |
|
dehnert
|
8204c03c0b
|
fixed a ton of warnings
|
8 years ago |
|
TimQu
|
5071df5c82
|
made sound value iteration work and respect the correct precision
|
8 years ago |
Sebastian Junges
|
ccfb1a292c
|
drn parser and exporter use reward names
|
8 years ago |
|
Sebastian Junges
|
2ce145745a
|
parameters from rewards are now also collected in wellformedness analysis
|
8 years ago |
|
Sebastian Junges
|
378e2ee40f
|
Better error message if expression parser fails
|
8 years ago |
|
TimQu
|
9140c1dc0e
|
statistics and empty-epoch-matrix optimization also for single objective case
|
8 years ago |
|
TimQu
|
108e8e69e8
|
Changed statistics output a little. Optimized the case where the transition matrix of the epoch model is empty
|
8 years ago |
