TimQu
|
45544ddee9
|
Merge branch 'master' into reward-bounded-multi-objective
|
7 years ago |
dehnert
|
bdbc6d9c69
|
fixed typo
|
7 years ago |
dehnert
|
4ef0b9eef1
|
more bug fixes in abstraction-refinement
|
7 years ago |
dehnert
|
9b972eef20
|
some bug fixes in abstraction-refinement
|
7 years ago |
dehnert
|
57a6115beb
|
new bisimulation-based abstraction-refinement model checker that uses the new abstraction-refinement framework
|
7 years ago |
dehnert
|
8e3e99c4ce
|
fixed bug in submatrix computation pointed out by Timo Gros
|
7 years ago |
dehnert
|
330dfb96c7
|
more work on abstraction-refinement framework
|
7 years ago |
sjunges
|
456523b6ec
|
fix missing initialisations
|
7 years ago |
dehnert
|
b110172b0d
|
fixed bug in MaxSMT-based counterexample generation pointed out by Milan Ceska
|
7 years ago |
dehnert
|
ce5c740c51
|
resolved ambiguity to make gcc happy
|
7 years ago |
dehnert
|
a072ef5310
|
some fixes to handle large parameters
|
7 years ago |
Matthias Volk
|
8ba365fee9
|
Fixed includes after moving files
|
7 years ago |
dehnert
|
ac759d2671
|
minor performance improvements to model building
|
7 years ago |
dehnert
|
6501fffac3
|
several optimizations related to explicit model building
|
7 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
|
7 years ago |
dehnert
|
8116b360ba
|
changed hash function of bit vector hash map
|
7 years ago |
dehnert
|
183eea7a89
|
more work on abstraction refinement framework
|
7 years ago |
dehnert
|
3a11914da0
|
commit to switch workplace
|
7 years ago |
dehnert
|
f772af6241
|
fixed bug in bit vector hash map
|
7 years ago |
dehnert
|
29903bef04
|
more work on general abstraction refinement framework
|
7 years ago |
dehnert
|
db7d058800
|
converted some assertions into exceptions in bit vector hash map
|
7 years ago |
dehnert
|
b99bc59215
|
adding some primes
|
7 years ago |
dehnert
|
41bc2c0de4
|
explicit instantiations to make gcc hapy
|
7 years ago |
Tom Janson
|
374f7e1fbb
|
kSP: disallow access to index 0 (1-based indices!)
|
7 years ago |
TimQu
|
2682100cfd
|
fixed more tests
|
7 years ago |
dehnert
|
48dc03846e
|
extended partial bisimulation model checker by games as quotients
|
7 years ago |
dehnert
|
aa1d9a6f85
|
Revert "intermediate commit to switch workplace"
This reverts commit 90cb987357 .
|
7 years ago |
dehnert
|
90cb987357
|
intermediate commit to switch workplace
|
7 years ago |
TimQu
|
419fcd1b43
|
Fixed test
|
7 years ago |
TimQu
|
c9beea4f33
|
better lower/upper result bounds
|
7 years ago |
TimQu
|
746a58ff12
|
better statistics output
|
7 years ago |
TimQu
|
86253fe88a
|
moved multidimensional unfolding implementation from multiobjective into helper namespace
|
7 years ago |
TimQu
|
17d6835477
|
removed acyclic minmax method as it is not much better then gauss-seidel style multiplications
|
7 years ago |
TimQu
|
d85a845b7d
|
Fixed cases where a solver guarantee was not established although it was needed by the termination condition
|
7 years ago |
TimQu
|
117d1b5c99
|
clean up single objective reward bounded case
|
7 years ago |
Matthias Volk
|
c4c6c9cbce
|
Test compiler configurations within cmake
|
7 years ago |
dehnert
|
5fd7878791
|
added option to refine over states whose signatures changed in dd-based bisimulation
|
7 years ago |
TimQu
|
016fedd58e
|
Better progress info
|
7 years ago |
TimQu
|
199d12a2c2
|
Merge remote-tracking branch 'origin/master' into reward-bounded-multi-objective
|
7 years ago |
TimQu
|
f2d837dc42
|
Merge remote-tracking branch 'origin/master' into reward-bounded-multi-objective
|
7 years ago |
dehnert
|
518773f18f
|
commit missing version file
|
7 years ago |
dehnert
|
e6f61fb441
|
fixed bug in hybrid engine when using interval iteration
|
7 years ago |
TimQu
|
9859f60db0
|
Fixed solver tests
|
7 years ago |
TimQu
|
f44ce8801c
|
"fixed" the tests that failed because of unsound value iteration
|
7 years ago |
TimQu
|
3571f0ddca
|
Respected that the solution is unique when doing value iteration
|
7 years ago |
TimQu
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
7 years ago |
dehnert
|
7dcb450aad
|
started on computing changed states in one shot
|
7 years ago |
dehnert
|
c85e30dfd0
|
added distance-aware initial partition to dd-based bisimulation
|
7 years ago |
dehnert
|
9498705c95
|
more reuse of values in bisimulation-based abstraction refinement
|
7 years ago |
dehnert
|
4fad33b5e8
|
started on optimizing bisimulation-based abstraction-refinement
|
7 years ago |