TimQu
|
e89cbf2886
|
fixed cyclic check.
|
7 years ago |
|
TimQu
|
88ee0bbf67
|
RewardUnfolding: If statistics are enabled, Log when an acyclic epoch model is found.
|
7 years ago |
|
TimQu
|
04082fb2d6
|
Added a method to check whether a graph contains a cycle.
|
7 years ago |
Matthias Volk
|
3c5f25fe4a
|
Get all model parameters
|
7 years ago |
Sebastian Junges
|
6c543df537
|
Fix in bisimulation of MDPs, which failed if all non-absorbing states in the quotient are initial
|
7 years ago |
|
Sebastian Junges
|
6c2262b7e8
|
more informative error messages during model building (for better debugging)
|
7 years ago |
|
Sebastian Junges
|
b59cbfa1de
|
graph conditions for rewards described by rational functions with nonconstant denominators
|
7 years ago |
|
Matthias Volk
|
8b87d79c3e
|
Removed copy-pasted references to DFTs
|
7 years ago |
|
Matthias Volk
|
87cd72f237
|
Output exception type in exception message
|
7 years ago |
|
TimQu
|
5ad100e652
|
quantiles: Added some statistics.
|
7 years ago |
|
TimQu
|
fb7078770d
|
rewardbounded: Various fixes.
|
7 years ago |
|
TimQu
|
dd93b1dae9
|
rewardbounded: Improved code structure.
|
7 years ago |
|
Sebastian Junges
|
8fbc8d56c0
|
graph preservation properties correctly computed for CTMCs
|
7 years ago |
|
TimQu
|
6aeb75e3bd
|
quantiles: Supporting two-dimensional quantiles with the same optimization direction of quantile bounds (max,max or min,min).
|
7 years ago |
|
TimQu
|
a99dd5e4d1
|
quantiles: Better code re-usage, better structure, support for 'open' and 'non-open' dimensions, single dimensional quantiles should work now.
|
7 years ago |
|
TimQu
|
1d5f2410b5
|
rewardBounded/RewardUnfolding: Allowed the case that not all dimensions have a bound a priori.
|
7 years ago |
Jip Spel
|
c33a8df85f
|
Eliminate selfloop introduced by SCC elimination
|
7 years ago |
|
TimQu
|
4ac23d630f
|
quantiles: Added support for formulas with trivial bounds (i.e., >=0).
|
7 years ago |
|
Matthias Volk
|
b2ea3993ef
|
Fixed assertion in symbolic bisimulation
|
7 years ago |
|
Tim Quatmann
|
6e8aef2acc
|
Checking formulas with >=0 bound.
|
7 years ago |
|
Matthias Volk
|
399c061086
|
Typos
|
7 years ago |
|
Matthias Volk
|
267efd692a
|
Construct time reward model
|
7 years ago |
|
Matthias Volk
|
dfd1fec8c5
|
Fixed compile issues
|
7 years ago |
|
TimQu
|
66ab97ba4f
|
transformer: Added functionality to also translate expected time formulas to expected rewards.
|
7 years ago |
|
Tim Quatmann
|
f99a24acd2
|
more work on quantiles.
|
7 years ago |
|
Tim Quatmann
|
82402ba3ae
|
rewardbounded: Moved epoch model analysis to a separate file.
|
7 years ago |
|
Tim Quatmann
|
661d922d2e
|
logic/bound: Added method to compare a bound with a value.
|
7 years ago |
|
TimQu
|
d796ee74de
|
(workplace switch)
|
7 years ago |
|
Tim Quatmann
|
d3abeb5f45
|
Started implementation on quantiles.
|
7 years ago |
|
TimQu
|
dc2654ce60
|
Quantiles: made the SparseMdpPrctlModelChecker call the QuantileHelper for quantile formulas
|
7 years ago |
|
TimQu
|
fe535b9ba6
|
Fixed QuantileFormula's writeToStream.
|
7 years ago |
|
Matthias Volk
|
09a5c44c6e
|
Fixed usage of denominatorAsNumber
|
7 years ago |
|
TimQu
|
7e66787c9c
|
logic: Added QuantileFormulas.
|
7 years ago |
dehnert
|
2768d15f4f
|
fixing minor issue in symboiic bisimulation relation pointed out by Tim
|
7 years ago |
|
TimQu
|
fceaeed557
|
Fixed a recently introduced issue with interval bounded ctmcs.
|
7 years ago |
|
Matthias Volk
|
230ac20480
|
Added progress measurements for Unif+ iterations and steps
|
7 years ago |
|
TimQu
|
629de20da0
|
Fixed running in an infinite loop when computing LRA on markov automata with relative precision.
|
7 years ago |
|
TimQu
|
0c905e2323
|
Fixed an issue where time-bounded properties were wrongly computed on a ctmc that only consists of goal-states.
|
7 years ago |
|
TimQu
|
384e7ace06
|
TopologicalMinMaxLinearEquationSolver: Reduced clutter in the --verbose output.
|
7 years ago |
|
Sebastian Junges
|
03b5c70c79
|
support for POMDPs in symoblic description
|
7 years ago |
|
Matthias Volk
|
94a1d47103
|
Use IMCA method for bounded until with lower bound > 0
|
7 years ago |
|
Matthias Volk
|
01a23856a8
|
Drastically decreased memory consumption of Unif+
|
7 years ago |
|
Matthias Volk
|
d054f3c64a
|
Result for upper bounds needs only be calculated for k=0
|
7 years ago |
|
Matthias Volk
|
4c5b041340
|
Debug output
|
7 years ago |
|
Matthias Volk
|
6220b114b5
|
Small simplifications
|
7 years ago |
|
Matthias Volk
|
f9fb90499d
|
Only keep track of results from the last iteration (instead of all iterations) for 2 of the 3 vectors
|
7 years ago |
|
Matthias Volk
|
8ae800b130
|
Changed iteration order to iterate over stepsize in outer loop
|
7 years ago |
|
Matthias Volk
|
cbd6139613
|
Small changes
|
7 years ago |
|
Matthias Volk
|
b8b2c58dab
|
Started on some refactoring in Unif+
|
7 years ago |
|
Matthias Volk
|
6066ecd590
|
Added struct for Unif+ vectors
|
7 years ago |
