|  TimQu | 37d5dceaab | added small check | 8 years ago | 
				
					
						|  TimQu | 7fc65707a9 | set the maximal value for each dimension. Also support for dependent dimensions | 8 years ago | 
				
					
						|  TimQu | 8f8f0bf804 | corrected the search for the set of reachble epoch classes | 8 years ago | 
				
					
						|  TimQu | d0209a804b | Setting reachable product states now also uses the transformMemoryState method | 8 years ago | 
				
					
						|  dehnert | cb849a9ab8 | started on computing upper bounds for rewards for interval value iteration | 8 years ago | 
				
					
						|  dehnert | 9d98bf5fa8 | automatically switching solvers if soundness is enforced | 8 years ago | 
				
					
						|  dehnert | df0b5fbfa5 | fixed multiply-reduce operations in the presence of empty row groups | 8 years ago | 
				
					
						|  TimQu | 17a45a43eb | better transformation of memory states | 8 years ago | 
				
					
						|  dehnert | d25cc4b05f | first version of sound value iteration | 8 years ago | 
				
					
						|  TimQu | 7d4a438e82 | Fixes for lower bounds | 8 years ago | 
				
					
						|  TimQu | ade8078759 | added test for lower bounded properties | 8 years ago | 
				
					
						|  dehnert | ec61e110f2 | introducing solver formats to enable linear equation solvers to take the fixed point rather than the equation system formulation | 8 years ago | 
				
					
						|  TimQu | b054b67312 | first version for lower bounded properties | 8 years ago | 
				
					
						|  TimQu | 4ba20d11d4 | more functionality for epoch manager | 8 years ago | 
				
					
						|  dehnert | 8e8fc34c30 | fixed some TBB-related issues and added power method for linear equation systems | 8 years ago | 
				
					
						|  dehnert | bac50a32ab | warkaround for gcc 7.2.0: make modernjson compile again | 8 years ago | 
				
					
						|  dehnert | 2d99ff3126 | preserving action knowledge from first to second PRISM parser pass | 8 years ago | 
				
					
						|  dehnert | c5134c364f | Extraction and update of TBB-parallelized stuff | 8 years ago | 
				
					
						|  TimQu | d129683c61 | gathered dimension related data into a struct. Also started with lower reward bounds | 8 years ago | 
				
					
						|  TimQu | 41cf4e76db | The solutions are now stored epoch-wise and will be erased as soon as all predecessor epochs are computed | 8 years ago | 
				
					
						|  TimQu | 3044aaa3f5 | The product model is now handled in a separate class | 8 years ago | 
				
					
						|  TimQu | 1ccc241462 | computations on epochs are now handled in a separate class | 8 years ago | 
				
					
						|  TimQu | d3e50b8769 | optimized productInState Computation | 8 years ago | 
				
					
						|  dehnert | bba2832e5b | finished Walker-Chae method | 8 years ago | 
				
					
						|  TimQu | 47ab74a16b | implemented single objective queries | 8 years ago | 
				
					
						|  TimQu | 8b466f1fa7 | extended multidimensional bounded until formulas to have different subformulas in each dimension | 8 years ago | 
				
					
						|  dehnert | 5440d164b2 | started on Walker-Chae algorithm | 8 years ago | 
				
					
						|  dehnert | c77b9ce404 | gauss-seidel style multiplication for gmm++ | 8 years ago | 
				
					
						|  dehnert | 43643b9699 | bump gmm++ version to 5.2 (from 5.0) | 8 years ago | 
				
					
						|  dehnert | d27954622a | slightly changed handling of gauss-seidel invocations in linear equation solver | 8 years ago | 
				
					
						|  dehnert | 6e548627ee | adding storm-pgcl as a dependency to target binaries | 8 years ago | 
				
					
						|  dehnert | 00f88ed452 | gauss-seidel-style value iteration | 8 years ago | 
				
					
						|  TimQu | cbe73081f8 | zig zag epoch computation order | 8 years ago | 
				
					
						|  TimQu | 6ae05560fc | setting solutions in place | 8 years ago | 
				
					
						|  dehnert | 9d95d2adcf | first version of multiply-and-reduce (only for native) | 8 years ago | 
				
					
						|  dehnert | e37d5869ef | extracted static version to separate cmake file | 8 years ago | 
				
					
						|  dehnert | dd035f7f5e | allow for summand in matrix-vector multiplication | 8 years ago | 
				
					
						|  TimQu | 488479b5a7 | better objectiveRewardFilter | 8 years ago | 
				
					
						|  TimQu | cd6a79de23 | used cache memory when checking each epoch | 8 years ago | 
				
					
						|  TimQu | 13ade58fa0 | using pair<uint, uint> in the map instead of vectors of size 2 | 8 years ago | 
				
					
						|  dehnert | 3c844a487f | some more optimizations | 8 years ago | 
				
					
						|  TimQu | 3a309caafc | epochs are now uints instead of vector<int>s | 8 years ago | 
				
					
						|  dehnert | 5fafe835cb | started on some optimizations for conditionals in MDPs | 8 years ago | 
				
					
						|  TimQu | 27ee299f63 | more efficient comparison of epoch classes | 8 years ago | 
				
					
						|  TimQu | cf91a34970 | use cached memory for the epoch results | 8 years ago | 
				
					
						|  TimQu | 9735ff98d0 | SolutionType is now a single vector instead of a struct | 8 years ago | 
				
					
						|  TimQu | d6099a91a7 | Further optimizations for setEpoch + started to work on single objective mode | 8 years ago | 
				
					
						|  TimQu | 57e604a815 | optimized setCurrentEpoch a little | 8 years ago | 
				
					
						|  TimQu | e4ac32a6fc | fixed selection of considered state in reduced model and optimized setting the stepsolutions | 8 years ago | 
				
					
						|  dehnert | 45e0796228 | updated changelog | 8 years ago |