Alexander Bork
|
c6902e0ca7
|
Added reward MDP generation for the overapproximation
|
6 years ago |
|
Alexander Bork
|
c663edbd85
|
Added generation of an MDP for the over-approximation in the on-the-fly state exploration
|
6 years ago |
|
Alexander Bork
|
bbd3ec7287
|
Fix of wrong MDP underapproximation
|
6 years ago |
|
Alexander Bork
|
b9c0af6628
|
Added on-the-fly belief grid generation for rewards
|
6 years ago |
|
Alexander Bork
|
21e417bdac
|
Added on-the-fly belief grid generation to avoid computations for unreachable beliefs
|
6 years ago |
|
Alexander Bork
|
bc52aa86ca
|
Added procedure to repeat probability computation with higher resolution
|
6 years ago |
|
Alexander Bork
|
a65c445243
|
Avoid multiple computation of size in subsimplex computation
|
6 years ago |
|
Alexander Bork
|
7afc47f354
|
Fixed wrong size of stateLabeling if no probability 0 states were found
|
6 years ago |
|
Alexander Bork
|
11f89de9e8
|
Added preprocessing to reduce the POMDP state space before analysis
|
6 years ago |
|
Alexander Bork
|
4b8664c521
|
Added reward under-approximation
|
6 years ago |
|
Alexander Bork
|
f119e3d4c7
|
Added reward over-approximation
|
6 years ago |
|
Alexander Bork
|
4c8395c3b1
|
Speedup of probability approximation
|
6 years ago |
|
Alexander Bork
|
f6d9a6ac02
|
Changed datatype used in POMDP analysis from RationalNumber to double for better comparision of approximation speeds with PRISM
|
6 years ago |
|
Alexander Bork
|
5de96cc170
|
Modified implementation to speed up the subsimplex computation
|
6 years ago |
|
Alexander Bork
|
959a2c2400
|
Added ability to use an MDP for the underapproximation
|
6 years ago |
Tim Quatmann
|
cb00c21db2
|
Fixed type uintX -> uintX_t
|
6 years ago |
|
Alexander Bork
|
3bd910f42b
|
Added timing and caching of subsimplex computation results
|
6 years ago |
|
Alexander Bork
|
d814942997
|
Working version of under-approximation
|
6 years ago |
|
Alexander Bork
|
2bc79e6e07
|
Refactoring to include a list of all generated beliefs
|
6 years ago |
|
Alexander Bork
|
74cfecd011
|
Working version of over-approximation
|
6 years ago |
|
Alexander Bork
|
7f9ad39d34
|
First version for the over-approximation of POMDP reachability
|
6 years ago |
Matthias Volk
|
685b5c6b27
|
Throw exceptions after switch/case to silence compiler warnings about not returning anything
|
6 years ago |
|
Matthias Volk
|
8332abab58
|
Removed unused variables
|
7 years ago |
|
TimQu
|
19070a27a9
|
added 'fixed ring' pattern
|
8 years ago |
|
TimQu
|
d06c2c791a
|
introducing pomdp memory patterns
|
8 years ago |
|
TimQu
|
d34a2dd9fd
|
fix for mec choice elimination
|
8 years ago |
|
TimQu
|
820f2ddf4c
|
extended mec eliminator to minimal rewards
|
8 years ago |
|
TimQu
|
90087ff526
|
added transformation to binary pomdp
|
8 years ago |
Sebastian Junges
|
fda3445746
|
options how to transform fsc
|
8 years ago |
|
TimQu
|
529e31a1ba
|
fixed multiple initial states in pomdp unfolder
|
8 years ago |
|
TimQu
|
2be3f553e0
|
fixes
|
8 years ago |
|
TimQu
|
31f8ec98e4
|
implemented the pomdp unfolding to convert k-memory-bounded pomdps to memoryless pomdps
|
8 years ago |
|
TimQu
|
88339f4cff
|
invoking new functionalities in the cli. Also silenced some debug output
|
8 years ago |
|
TimQu
|
1d1a198f5e
|
generalizing the Selfloop elimination ideo to MECs
|
8 years ago |
|
TimQu
|
412ecbcd36
|
Qualitative analysis of pomdps
|
8 years ago |
sjunges
|
3ac42caf7c
|
extensions to pomdp stuff
|
8 years ago |
|
Sebastian Junges
|
d4980ca325
|
intermediate commit
|
8 years ago |
|
sjunges
|
10b1f65840
|
eliminating selfloops in pomdps
|
8 years ago |
|
Sebastian Junges
|
790fbffd6d
|
pomdps in an own cli, support for application of stochastic schedulers, etc
|
8 years ago |
