dehnert
|
29f0f66689
|
reworked getUniqueRewardModel a little
Former-commit-id: b0a3677c1a [formerly a2124b3363 ]
Former-commit-id: c76a56a168
|
9 years ago |
Mavo
|
566cef0f91
|
Started on compiling without Carl
Former-commit-id: 5e0895d7c5
|
9 years ago |
dehnert
|
2a7dc0fad0
|
renamed MarkovChainSettings
Former-commit-id: 39024731f8
|
9 years ago |
dehnert
|
f3fa90cc37
|
more work towards exact solving
Former-commit-id: 38edbcf2ca
|
9 years ago |
Mavo
|
a0d659f2da
|
always use shared_ptr<Formula const>
Former-commit-id: 63a447e887
|
9 years ago |
dehnert
|
2f5f439f26
|
re-added (naive) splitter selection heuristic
Former-commit-id: 5c5166510d
|
9 years ago |
Mavo
|
effadc5cca
|
Split into general settings and markov chain settings
Former-commit-id: 619a2e3622
|
9 years ago |
Mavo
|
67d77608bd
|
Refactoring of settings
Former-commit-id: ea4350fc1c
|
9 years ago |
dehnert
|
dc8a5b11e0
|
more refactoring regarding fragment checking
Former-commit-id: fd335f6f8e
|
9 years ago |
dehnert
|
b772c92edb
|
removed reward path formulas. reward path formulas are now just path formulas. this allows some invalid formulas to be constructed, so this now has to be checked dynamically
Former-commit-id: c8527c8e9a
|
9 years ago |
sjunges
|
d8191d8c6a
|
const formulae
Former-commit-id: 910d7ca539
|
9 years ago |
sjunges
|
ad01dfa611
|
refactored bisimulation a bit (mainly the entry point as well as hidden some options)
Former-commit-id: 5405a14930
|
9 years ago |
dehnert
|
98d173ca3c
|
changed elimination-based model checker to be able to compute values for all states (for reachability probs and reachability rewards)
Former-commit-id: 016a25734a
|
10 years ago |
dehnert
|
fdf237ca67
|
added support to create measure driven initial partition for bisimulation for MDPs from formula that does not specify an optimization direction
Former-commit-id: 0d3970456b
|
10 years ago |
dehnert
|
b31d98909b
|
Explicit MDP bisim working but unfortunately slow :(
Former-commit-id: 6714bdbd61
|
10 years ago |
dehnert
|
7156a63b0f
|
tried different approach for bisim for MDPs
Former-commit-id: 92d56a4620
|
10 years ago |
dehnert
|
c2a0bd5ab0
|
initial outline of strong MDP bisimulation
Former-commit-id: 06452543ea
|
10 years ago |
dehnert
|
9475d29164
|
fixed weak bisim for dtmc
Former-commit-id: 05462b99ec
|
10 years ago |
dehnert
|
29597e014f
|
more work on reimplementation of weak bisim
Former-commit-id: 5bdd8ea139
|
10 years ago |
dehnert
|
46fee522ff
|
made strong bisim for DTMCs work again
Former-commit-id: e42bafef4d
|
10 years ago |
dehnert
|
1f5110b90c
|
work on making bisimulation fast again :(
Former-commit-id: bb89091b2d
|
10 years ago |
dehnert
|
2484a515a0
|
some more work on bisim
Former-commit-id: aaa8088b00
|
10 years ago |
dehnert
|
40a75baee7
|
using some template magic to make it compile again
Former-commit-id: 69888cac45
|
10 years ago |
dehnert
|
11c21eb338
|
on my way of making (the refactored version) bisimulation work again for deterministic models
Former-commit-id: 79c089a693
|
10 years ago |
dehnert
|
96954ddd15
|
refactoring of bisimulation class in the prospect of extending it to (CT)MDPs, not yet done
Former-commit-id: 09f47ad977
|
10 years ago |