Matthias Volk
|
972371c9a2
|
Started on the notion of 'relevant events' for DFT analysis
|
6 years ago |
|
Matthias Volk
|
3bf14c5198
|
Larger refactoring for DFT BEs. Split into BEExponential and BEConst
|
6 years ago |
|
Matthias Volk
|
19ba1c38e7
|
Set correct order for priorities according to heuristic
|
6 years ago |
|
Matthias Volk
|
ef16ba576c
|
Added default case for switch
|
6 years ago |
|
Matthias Volk
|
7a8dbf8828
|
Heuristic is argument for functions in approximation algorithm
|
6 years ago |
|
Matthias Volk
|
5d8fc7db77
|
Removed approximation heuristic NONE
|
6 years ago |
|
Matthias Volk
|
37d0b66e73
|
Some fixes for approximation
|
6 years ago |
|
Matthias Volk
|
6eb2795b68
|
Fixed crucial bug marking all states as 'to expand'.
As a result no states were skipped during exploration and no approximation took place.
|
6 years ago |
|
Matthias Volk
|
0904c01828
|
Make exploration heuristic choosable
|
6 years ago |
|
Matthias Volk
|
e53d946b04
|
Refactored BucketPriorityQueue
|
6 years ago |
|
Matthias Volk
|
98b628b269
|
Moved failableBE/Dependencies to own struct
|
7 years ago |
|
Matthias Volk
|
a302ec9cfc
|
Fix in BucketPriorityQueue
|
7 years ago |
|
Matthias Volk
|
d062e658e0
|
Output progress for DFT exploration
|
7 years ago |
|
Matthias Volk
|
0e0a3dd9af
|
Fixed problem with BitVector size mismatch for DFT states
|
7 years ago |
dehnert
|
0d18886966
|
re-enabling conversion of MA to CTMC if the MA only has Markovian states
|
8 years ago |
|
Matthias Volk
|
0913388cd3
|
Renamed ExplicitDFTModelBuilderApprox to ExplicitDFTModelBuilder
|
8 years ago |
|
Matthias Volk
|
91bd638c18
|
Fixed segfault
|
8 years ago |
|
Matthias Volk
|
8a74be1b72
|
Refactored DFT settings
|
8 years ago |
TimQu
|
f2ab549b36
|
fixed compiling storm-dft
|
8 years ago |
|
Matthias Volk
|
affa7db555
|
Depth heuristic did not skip
|
9 years ago |
|
Matthias Volk
|
8cbfccba22
|
Hacked approximation for probabilities
|
9 years ago |
|
Matthias Volk
|
5c0e515ade
|
Build all labels when exporting DFT
|
9 years ago |
|
Matthias Volk
|
02c7ace5e6
|
Use heuristic NONE
|
9 years ago |
|
Matthias Volk
|
1c2426b0f4
|
Print model information
|
9 years ago |
|
Matthias Volk
|
a477784069
|
Small fix when computing upper bound in failed states
|
9 years ago |
|
Matthias Volk
|
7d3fee88f8
|
Use fail labels according to given properties
|
9 years ago |
|
Matthias Volk
|
036d9c55d5
|
Small fixes
|
9 years ago |
|
Matthias Volk
|
69e2aac5c9
|
Fixed labeling when using multiple failed states
|
9 years ago |
sjunges
|
112fb8f61e
|
moving dfts to their own lib and cli
|
9 years ago |
Sebastian Junges
|
d246517757
|
removed src prefix in all includes
|
9 years ago |
|
Sebastian Junges
|
e1d201c85e
|
c++ code compiles again after rename
|
9 years ago |
|
Sebastian Junges
|
3a7ee7867b
|
rename files (does not compile)
|
9 years ago |
Mavo
|
ee4b6c96a8
|
Use operator<< from carl
Former-commit-id: 733c029ebe
|
9 years ago |
|
Mavo
|
cd1aec7750
|
Heuristic using the difference between upper and lower bound
Former-commit-id: a514e33d69
|
9 years ago |
|
Mavo
|
1c95722711
|
Do not skip states if approx = 0.0
Former-commit-id: 37dbb9739c
|
9 years ago |
|
Mavo
|
d95bb71f75
|
Tried to gain more performance
Former-commit-id: 9af2ab7ce0
|
9 years ago |
|
Mavo
|
64699a7bad
|
Several improvements
Former-commit-id: 047ebde33b
|
9 years ago |
|
Mavo
|
dae1a7eefe
|
Do not use cold BEs in first step of approximation formula
Former-commit-id: d204be9633
|
9 years ago |
|
Mavo
|
02c4195f31
|
Better upper bound for independent subtrees
Former-commit-id: 64f5a1ca60
|
9 years ago |
|
Mavo
|
6778a018ad
|
Use heuristic probability
Former-commit-id: 747b34cfdc
|
9 years ago |
|
Mavo
|
c12bbe2904
|
Disable old way of computing permutations as there is a bug for >31 elements
Former-commit-id: ae7af404f3
|
9 years ago |
|
Mavo
|
876b147aa8
|
Fixed bug with iterator
Former-commit-id: f7248a57c1
|
9 years ago |
|
Mavo
|
d9b1285644
|
Alternative way of computing permutations (at the moment in parallel)
Former-commit-id: f5886860bc
|
9 years ago |
|
Mavo
|
386d4c7f05
|
Use heuristic NONE to explore complete state space
Former-commit-id: 25990b5dda
|
9 years ago |
|
Mavo
|
8e159133da
|
Compute lower/upper bounds only when needed
Former-commit-id: 8f3af1ab10
|
9 years ago |
|
Mavo
|
a9f97bd210
|
Set heuristic to probability
Former-commit-id: a7d8fd7738
|
9 years ago |
|
Mavo
|
58f8707293
|
Tighter over-approximation
Former-commit-id: 824e74f88d
|
9 years ago |
|
Mavo
|
0d9cdd6ef8
|
Use Heuristic None
Former-commit-id: 63f78f3db0
|
9 years ago |
|
Mavo
|
8b78ed2340
|
Renamed rateratio to probability
Former-commit-id: 6d07985b1d
|
9 years ago |
|
Mavo
|
945447e7e0
|
Use DFS as default
Former-commit-id: 34f9e80d1b
|
9 years ago |
