dehnert
|
2768d15f4f
|
fixing minor issue in symboiic bisimulation relation pointed out by Tim
|
6 years ago |
Matthias Volk
|
98b628b269
|
Moved failableBE/Dependencies to own struct
|
6 years ago |
|
Matthias Volk
|
53fa42f279
|
Ensure failable dependencies are only added once
|
6 years ago |
|
Matthias Volk
|
1fcc375608
|
BE can no longer fail after triggered failure
|
6 years ago |
|
Matthias Volk
|
fb1ea21f9c
|
Added assertions to exclude self-loops in DFT state generation
|
6 years ago |
|
Matthias Volk
|
9b11fed0c8
|
Fixed warning
|
6 years ago |
|
Matthias Volk
|
e5049c67da
|
Storm version 1.3.0
|
6 years ago |
|
Matthias Volk
|
d3356cd3e4
|
Use master14 branch for Carl
|
6 years ago |
|
Matthias Volk
|
3e2da7eba1
|
Merge branch 'unifplus_refactor'
|
6 years ago |
|
Matthias Volk
|
99808240bf
|
Updated changelog
|
6 years ago |
TimQu
|
fceaeed557
|
Fixed a recently introduced issue with interval bounded ctmcs.
|
6 years ago |
|
Matthias Volk
|
8c572ba550
|
Merge branch 'master' into unifplus_refactor
|
6 years ago |
|
Matthias Volk
|
230ac20480
|
Added progress measurements for Unif+ iterations and steps
|
6 years ago |
|
Matthias Volk
|
2197f3c34a
|
Updated changelog
|
6 years ago |
|
TimQu
|
aacdf5c0b5
|
Updated changelog.
|
6 years ago |
|
TimQu
|
629de20da0
|
Fixed running in an infinite loop when computing LRA on markov automata with relative precision.
|
6 years ago |
|
TimQu
|
0c905e2323
|
Fixed an issue where time-bounded properties were wrongly computed on a ctmc that only consists of goal-states.
|
6 years ago |
|
TimQu
|
384e7ace06
|
TopologicalMinMaxLinearEquationSolver: Reduced clutter in the --verbose output.
|
6 years ago |
Sebastian Junges
|
03b5c70c79
|
support for POMDPs in symoblic description
|
6 years ago |
|
Sebastian Junges
|
36ed6f0a91
|
Merge branch 'master' of https://srv-i2.informatik.rwth-aachen.de/scm/git/storm
|
6 years ago |
|
Sebastian Junges
|
cab2b3d8f1
|
changelog preparation for version 1.3.0
|
6 years ago |
|
Matthias Volk
|
94a1d47103
|
Use IMCA method for bounded until with lower bound > 0
|
6 years ago |
|
TimQu
|
c1119fcd8d
|
Triggered conversion from PRISM to JANI when building an MA with the dd engine since MAs are unsupported in the DdPrismModelBuilder.
|
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 |
|
Matthias Volk
|
97b14e35d5
|
Small renaming
|
6 years ago |
|
TimQu
|
19f353591f
|
Added an option to transform CTMCs to MAs and DTMCs to MDPs.
|
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
|
6e3639c8f1
|
Added new minmax method: Vi-to-Pi, which first performs value iteration with doubles, to find a good initial policy for (potentially exact) policy iteration.
|
6 years ago |
|
TimQu
|
240faff125
|
BuilderOptions: Added terminal states for bounded until and reachability reward formulas.
|
6 years ago |
|
TimQu
|
fa2bcbd71b
|
storm-conv: Fixed wrong jani export of step-bounded until properties in discrete time models.
|
6 years ago |
|
TimQu
|
605c13238e
|
Correctly handle the case where no model description is provided to the builder options.
|
6 years ago |
|
TimQu
|
02977da3d7
|
Apply maximum progress assumption while building a Markov Automaton explicitly.
|
6 years ago |
|
TimQu
|
b84ce33956
|
TopologicalMinMaxLinearEquationSolver: Handled prob 1 selfloops more correctly.
|
6 years ago |
|
TimQu
|
c614e9d747
|
Fixed Value Iteration based LRA computation
|
6 years ago |
Jip Spel
|
26ee89a856
|
Check assumptions on a region
|
6 years ago |
|
TimQu
|
2aeab4b2e7
|
Let the topological equation solvers handle singleton SCCs with self-loops directly.
|
6 years ago |
|
TimQu
|
4924a0e557
|
Fixed 'isZero' function in ConstantsComparator.
|
6 years ago |
|
TimQu
|
d2cd142dfb
|
Fixed initial partitioning in sparse bisimulation with action-based rewards.
|
6 years ago |
|
TimQu
|
8a7a604f4c
|
Fixed actually taking options for non-deterministic bisimulation when performing non-deterministic bisimulation.
|
6 years ago |
|
TimQu
|
985319c7dd
|
Tweaked LRA computation for MDPs and MAs in sound mode to meet precision requirements.
|
6 years ago |
|
TimQu
|
5d61329eb3
|
SVI with relative precision computed values that were unnecessarily precise.
|
6 years ago |
