Matthias Volk
|
94a1d47103
|
Use IMCA method for bounded until with lower bound > 0
|
6 years ago |
|
Matthias Volk
|
01a23856a8
|
Drastically decreased memory consumption of Unif+
|
6 years ago |
|
Matthias Volk
|
d054f3c64a
|
Result for upper bounds needs only be calculated for k=0
|
6 years ago |
|
Matthias Volk
|
4c5b041340
|
Debug output
|
6 years ago |
|
Matthias Volk
|
6220b114b5
|
Small simplifications
|
6 years ago |
|
Matthias Volk
|
f9fb90499d
|
Only keep track of results from the last iteration (instead of all iterations) for 2 of the 3 vectors
|
6 years ago |
|
Matthias Volk
|
8ae800b130
|
Changed iteration order to iterate over stepsize in outer loop
|
6 years ago |
|
Matthias Volk
|
cbd6139613
|
Small changes
|
6 years ago |
|
Matthias Volk
|
b8b2c58dab
|
Started on some refactoring in Unif+
|
6 years ago |
|
Matthias Volk
|
6066ecd590
|
Added struct for Unif+ vectors
|
6 years ago |
|
Matthias Volk
|
70d3f8d811
|
Unified order of function arguments for Unif+
|
6 years ago |
TimQu
|
27d87da93d
|
Fixed value iteration based LRA method for Markov Automata, where end components do not contain probabilistic states.
|
6 years ago |
|
TimQu
|
c614e9d747
|
Fixed Value Iteration based LRA computation
|
7 years ago |
|
TimQu
|
985319c7dd
|
Tweaked LRA computation for MDPs and MAs in sound mode to meet precision requirements.
|
7 years ago |
|
TimQu
|
9be488b969
|
Enabling expected time queries for ctmcs in the hybrid engine.
|
7 years ago |
|
TimQu
|
e6fc962e5e
|
In exact mode, use LP as LRA Method for nondeterministic models.
|
7 years ago |
|
TimQu
|
e94b37d2f5
|
instantaneous reward properties for continuous time models can not be handled in exact mode.
|
7 years ago |
|
TimQu
|
bb7f4dd6d7
|
canHandle method of exact continuous time model checkers now return 'false' for time-bounded properties
|
7 years ago |
dehnert
|
abe7510ae9
|
added clearing requirements
|
7 years ago |
|
dehnert
|
9ed6f084e7
|
adding uniqueness constraint in LRA computation also for fixed-point formulation
|
7 years ago |
|
dehnert
|
db6f43ed9d
|
made LRA computation for deterministic systems able to respect that the underlying solver requires a fixed-point formulation
|
7 years ago |
|
TimQu
|
5a16b2befa
|
minor fixes to let the total reward tests compile and pass
|
7 years ago |
|
TimQu
|
8df9b461cb
|
total reward formulas for ctmcs and markov automata
|
7 years ago |
|
dehnert
|
e1bb35ca0f
|
fix for the generator matrix fix
|
7 years ago |
|
dehnert
|
62e493d978
|
fix computation of generator matrix, pointed out by jklein
|
7 years ago |
|
Matthias Volk
|
e513015b49
|
Compute all reachabilities probabilities in a forward manner
|
7 years ago |
|
Matthias Volk
|
333d1ae375
|
Function for computing all transient probabilities
|
7 years ago |
|
TimQu
|
3310f51857
|
allowed for more fine grained solver requirements
|
7 years ago |
|
dehnert
|
316412c5d3
|
fixed a bug related to closing symbolic Markov automata
|
7 years ago |
|
dehnert
|
de2e94cac7
|
polished unifplus code a bit and made it the default MA (bounded reachability) solution method
|
7 years ago |
|
dehnert
|
7150354b9d
|
fixing issue related to vector swapping in (explicit) value iteration and power method
|
7 years ago |
|
dehnert
|
51ebb47587
|
added timing measurements to symbolic to sparse conversion in hybrid model checkers
|
7 years ago |
|
TimQu
|
51884895c8
|
Removed linear equation solver factories in model checkers
|
7 years ago |
|
TimQu
|
9e875adea9
|
Using Multiplier in CTMC and DTMC model checkers
|
7 years ago |
|
TimQu
|
a2bd1e0026
|
renamed argument from getRequirements so that it is easier to understand
|
7 years ago |
Timo Philipp Gros
|
4a321aab28
|
delete comment
|
7 years ago |
|
Timo Philipp Gros
|
6a52a953c2
|
clean up code
|
7 years ago |
|
Timo Philipp Gros
|
2ea911f865
|
finished version of implementation
|
7 years ago |
|
Timo Philipp Gros
|
0d1de8aba9
|
restructured code, SCC missing
|
7 years ago |
|
Timo Philipp Gros
|
b9007aa2e9
|
removed logprints
|
7 years ago |
|
Timo Philipp Gros
|
3a94b8ad69
|
ignoring kappa, taking in account epsilon
|
7 years ago |
|
Timo Philipp Gros
|
0004c9b2bb
|
adding version with value iteration
|
7 years ago |
|
Timo Philipp Gros
|
95c23b50d1
|
removing log prints again
|
7 years ago |
|
Timo Philipp Gros
|
7577ca48ec
|
changed loop of diff checking;
;
|
7 years ago |
|
Timo Philipp Gros
|
e5f71aa851
|
prints for foxGlynn
|
7 years ago |
|
Timo Philipp Gros
|
cc8b6f6af0
|
fixed stupid uniformisation bug
|
7 years ago |
|
Timo Philipp Gros
|
95c12cf6d8
|
new use of FixGlynn
|
7 years ago |
|
Timo Philipp Gros
|
79ba044c49
|
prints
|
7 years ago |
|
Timo Philipp Gros
|
fcd91ecb30
|
fixed typo
|
7 years ago |
|
Timo Philipp Gros
|
4b2ddf3c6f
|
leaving probloop deletion
|
7 years ago |
