Mavo
|
02c4195f31
|
Better upper bound for independent subtrees
Former-commit-id: 64f5a1ca60
|
8 years ago |
Mavo
|
a2c484bba4
|
Support for probability approximation without modularisation
Former-commit-id: 921c8d310c
|
8 years ago |
Mavo
|
b669a3acef
|
Only sort bucket queue if more than 10% is unsorted
Former-commit-id: 7ebd1e49c8
|
8 years ago |
Mavo
|
6778a018ad
|
Use heuristic probability
Former-commit-id: 747b34cfdc
|
8 years ago |
Mavo
|
d814143c09
|
Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
Former-commit-id: 8e9ec487c5
|
8 years ago |
Mavo
|
c12bbe2904
|
Disable old way of computing permutations as there is a bug for >31 elements
Former-commit-id: ae7af404f3
|
8 years ago |
Mavo
|
aa9cc2e0e5
|
Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
Former-commit-id: f2fe83ee35
|
8 years ago |
Mavo
|
876b147aa8
|
Fixed bug with iterator
Former-commit-id: f7248a57c1
|
8 years ago |
Mavo
|
d9b1285644
|
Alternative way of computing permutations (at the moment in parallel)
Former-commit-id: f5886860bc
|
8 years ago |
Mavo
|
386d4c7f05
|
Use heuristic NONE to explore complete state space
Former-commit-id: 25990b5dda
|
8 years ago |
Mavo
|
8e159133da
|
Compute lower/upper bounds only when needed
Former-commit-id: 8f3af1ab10
|
8 years ago |
Mavo
|
a9f97bd210
|
Set heuristic to probability
Former-commit-id: a7d8fd7738
|
8 years ago |
Mavo
|
58f8707293
|
Tighter over-approximation
Former-commit-id: 824e74f88d
|
8 years ago |
Mavo
|
0d9cdd6ef8
|
Use Heuristic None
Former-commit-id: 63f78f3db0
|
8 years ago |
Mavo
|
20b00e8f1d
|
Propagate dont care to currently not failable BEs
Former-commit-id: 1fcb15f4ec
|
8 years ago |
Mavo
|
8b78ed2340
|
Renamed rateratio to probability
Former-commit-id: 6d07985b1d
|
8 years ago |
Mavo
|
945447e7e0
|
Use DFS as default
Former-commit-id: 34f9e80d1b
|
8 years ago |
Mavo
|
815bbf10ab
|
Remove map and use linear search in BucketPriorityQueue
Former-commit-id: 3fc131facb
|
8 years ago |
Mavo
|
ef7d4ac87b
|
Do not sort BEs anymore
Former-commit-id: 1789ad3644
|
8 years ago |
Mavo
|
8d38358c11
|
Use BucketPriorityQueue instead of DynamicPriorityQueue
Former-commit-id: 7a22ef5b16
|
8 years ago |
Mavo
|
d1d77ff4df
|
Changed deque to vector in bisimulation to gain performance boost
Former-commit-id: 5db8e917b4
|
8 years ago |
Mavo
|
82a3964e5d
|
Only fix queue when needed
Former-commit-id: 50231c4554
|
8 years ago |
Mavo
|
a333d29d16
|
Hard coded heuristic to gain performance
Former-commit-id: d0d869bb3e
|
8 years ago |
Mavo
|
a624292ece
|
Output no states
Former-commit-id: d1548bb3fb
|
8 years ago |
Mavo
|
ec8b5a23f2
|
Fixed compile issues with under Linux
Former-commit-id: 17f4d895ec
|
8 years ago |
Mavo
|
1bfd974795
|
Minor fixes
Former-commit-id: 9344ebe5aa
|
8 years ago |
Mavo
|
4a6f53031e
|
Choose different approximation heuristics
Former-commit-id: e9ddae066b
|
8 years ago |
Mavo
|
26d0a3a7a4
|
Fixed smaller bugs
Former-commit-id: 4c9c22bca1
|
8 years ago |
Mavo
|
8e1e61c4f2
|
Changed datastructures and made handling of pseudo states easier
Former-commit-id: a0e0324fe6
|
8 years ago |
Mavo
|
e05c4dab0d
|
Use custom DynamicPriorityQueue
Former-commit-id: b4b552a84d
|
8 years ago |
Mavo
|
faadf19228
|
Approximation error is relative to mean of lower and upper bound
Former-commit-id: f01c027a3a
|
8 years ago |
Mavo
|
ea00abc35e
|
Fixed problems with approximation while using symred
Former-commit-id: df12c037e7
|
8 years ago |
Mavo
|
a419cb0d80
|
Fixed computing rates for lower and upper bound
Former-commit-id: 89846a9788
|
8 years ago |
Mavo
|
6faa7f0429
|
Abort when getting infinity in approximation
Former-commit-id: 8bfda3656a
|
8 years ago |
Mavo
|
3d083a1719
|
Fixed bug with wrong row in case of nondeterminism
Former-commit-id: 24d7bd672c
|
8 years ago |
Mavo
|
2f765a9a95
|
Expand states reached be dependencies
Former-commit-id: ab22162ed5
|
8 years ago |
Mavo
|
53821d3d84
|
Added settings for approximation heuristic
Former-commit-id: 40267add31
|
8 years ago |
Mavo
|
6b7bf3bba7
|
Introduced heuristic depth with distance from initial state
Former-commit-id: 1b94ebc4f9
|
8 years ago |
Mavo
|
41a71f8688
|
Fixed bug with not setting nondetermism correctly
Former-commit-id: cd1e029c29
|
8 years ago |
Mavo
|
bf491117c7
|
Sort row only if replacement took place
Former-commit-id: 84f584d6c4
|
8 years ago |
Mavo
|
aab45d4eab
|
Naive iterative refinement of approximation
Former-commit-id: e1620cdefd
|
8 years ago |
Mavo
|
d3d360b50a
|
First version of DFT approximation
Former-commit-id: 1d95ad4914
|
8 years ago |
Mavo
|
cfc082417b
|
Refactoring
Former-commit-id: b3896c45a4
|
8 years ago |
Mavo
|
fba2071e9f
|
Dft exploration via NextStateGenerator
Former-commit-id: f81ac4e7fc
|
8 years ago |
Mavo
|
495b42ff4c
|
Temporarily split new approximating state generation into own builder
Former-commit-id: 70be02f2ae
|
8 years ago |
Mavo
|
12f7c08bac
|
New class for DftStateGenerator
Former-commit-id: 5d7f798de1
|
8 years ago |
Mavo
|
662bbd73d7
|
CompressedStateType as template argument for NextStateGenerator
Former-commit-id: 145182a918
|
8 years ago |
Mavo
|
560b42a94a
|
Some interval functions not implemented
Former-commit-id: c88dca9d96
|
8 years ago |
Mavo
|
a0cd149054
|
Introduced setting for DFT approximation
Former-commit-id: 03a2c0ca0c
|
9 years ago |
Mavo
|
c4260d3d5a
|
First try on approximation
Former-commit-id: 53c6738c72
|
9 years ago |