dehnert
|
8f7c9d5c25
|
Adapted SCC-interface such that it can also be given a matrix instead of a model. More work on SCC-based mc.
Former-commit-id: 21d2482e4c
|
11 years ago |
dehnert
|
610274dd3e
|
Further work on SCC-based mc.
Former-commit-id: a0a2cba226
|
11 years ago |
dehnert
|
b068499a24
|
Tuned SCC decomposition a bit.
Former-commit-id: 3f8c77f042
|
11 years ago |
dehnert
|
2c231a794d
|
SCC decomposition now correctly ignores zero-entries in the matrix.
Former-commit-id: 351c0ac6ad
|
11 years ago |
dehnert
|
d40573640f
|
Dropped our current Tarjan-implementation in favour of the path-based algorithm by Gabow (and others) as this seems to perform a lot better (at when comparing our implementations).
Former-commit-id: 5cfeb85193
|
11 years ago |
dehnert
|
db232fe39b
|
Moved from pair to MatrixEntry as the basic building block of the matrix. Now matrix elements can be accessed in a more readable way.
Former-commit-id: f6514eb0cd
|
11 years ago |
dehnert
|
f79329bd9d
|
Fixed SCC decomposition. Added functional tests for SCC decomposition.
Former-commit-id: 25a7805fcb
|
11 years ago |
dehnert
|
f32853b6aa
|
Beautified remaining storage classes a bit.
Former-commit-id: 93f272727f
|
11 years ago |
dehnert
|
cf2b84b281
|
Further work on iterators for sparse matrix.
Former-commit-id: 8e78262161
|
11 years ago |
dehnert
|
a26f63be30
|
Finished reworking the sparse matrix implementation. Adapted all other classes to the (partially) new API of the matrix.
Former-commit-id: 2c3b5a5bc3
|
11 years ago |
dehnert
|
07fbff7a07
|
Started refactoring bit vector class.
Former-commit-id: a2fecfce2b
|
12 years ago |
dehnert
|
101c39f365
|
Added correct detection of states that possess infinite exptected time to reach a given goal set.
Former-commit-id: 4bc605d89d
|
12 years ago |
dehnert
|
b9130180ee
|
Rough sketch of MEC decomposition.
Former-commit-id: 027b58d380
|
12 years ago |
dehnert
|
f287b7e760
|
Further steps towards implementation of MEC decomposition.
Former-commit-id: 8166b3b923
|
12 years ago |
dehnert
|
09f192b40f
|
Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.
Former-commit-id: 4596ba71ec
|
12 years ago |