Sebastian Junges
|
98969e627c
|
updated counterexamples to support statistics to be exported
|
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 |
|
dehnert
|
86069b8552
|
fix typo in JSON exporter
|
7 years ago |
|
dehnert
|
50aa6d1424
|
assuming the only global real transient variable is the reward when exporting JANI and no reward model is mentioned in the property (issues a warning)
|
7 years ago |
|
dehnert
|
c4bed85dc4
|
switching to native linear equation solver by default and power iteration
|
7 years ago |
TimQu
|
1f6fc7e273
|
Better conversion of MA to CTMC if there are only Markovian states
|
7 years ago |
|
TimQu
|
b696d63953
|
checking if a facet has been analyzed sufficiently precise via smt
|
7 years ago |
|
TimQu
|
fbce6a4795
|
added function to check whether a vector has a zero element
|
7 years ago |
|
TimQu
|
8a579f1e95
|
Better conversion of MA to CTMC if there are only Markovian states
|
7 years ago |
|
TimQu
|
d47b86d4d7
|
Better conversion of MA to CTMC if there are only Markovian states
|
7 years ago |
|
TimQu
|
ac1d5df5c4
|
debugging and output of results for deterministic pareto explorer
|
7 years ago |
|
TimQu
|
571e157eef
|
added missing return statement
|
7 years ago |
|
TimQu
|
5c08d85a38
|
Fixes for multiobjective preprocessor in cases where reduction to total rewards is not possible
|
7 years ago |
|
TimQu
|
cd5b805a76
|
Under- and overapproximation for Pareto curve check result are now optional
|
7 years ago |
|
TimQu
|
b748b27b85
|
fixed compilation of settings...
|
7 years ago |
|
TimQu
|
b14c554df2
|
correct treatment of Markov Automata in scheduler evaluator
|
7 years ago |
|
TimQu
|
a73574a99f
|
added functionality to translate a polytope to an expression
|
7 years ago |
|
TimQu
|
f1eaab5603
|
enabling preservation of total reward formulas in ContinuousToDiscreteTimeModelTransformer
|
7 years ago |
|
TimQu
|
0e70cfc617
|
added setting to print intermediate results during the computation
|
7 years ago |
|
TimQu
|
789367a28b
|
using new memory incorporation in multi objective model checking
|
7 years ago |
|
TimQu
|
d24d1bdcd8
|
added memory incorporation transformer
|
7 years ago |
|
TimQu
|
5163803243
|
added nondeterministic memory structure
|
7 years ago |
|
TimQu
|
51a5a82a5f
|
more functionality for deterministic Pareto Explorer
|
7 years ago |
|
TimQu
|
7b43e79ff5
|
adding missing template instantiation
|
7 years ago |
|
TimQu
|
5f8af5a38a
|
added coordinate utility file
|
7 years ago |
|
TimQu
|
80da98eec5
|
adding shift method to polytope interface
|
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 |
|
TimQu
|
b5566fa861
|
more on total reward formulas for mdps
|
7 years ago |
|
TimQu
|
b3edae8707
|
fixed fragment specification: total reward formulas should not be supported for hybrid/dd right now
|
7 years ago |
|
TimQu
|
c2dd57cda5
|
total rewards for mdps
|
7 years ago |
|
TimQu
|
87e34d7b32
|
Added Support for Total Reward Formulas for DTMCs in the Sparse Engine
|
7 years ago |
|
TimQu
|
e4817759df
|
policy iteration based weight vector checker
|
7 years ago |
|
TimQu
|
aece3020f6
|
improved functionality of the scheduler evaluator
|
7 years ago |
|
dehnert
|
dfc0141894
|
minor fix to Z3 API modification
|
7 years ago |
|
dehnert
|
cdfa328464
|
first attempt at adapting to Z3 interface change
|
7 years ago |
|
TimQu
|
bf973187c4
|
use deterministicParetoExplorer in case there is a scheduler restriction.
|
7 years ago |
|
TimQu
|
a638104adb
|
using new post processing class for the 'old' implementation.
|
7 years ago |
|
TimQu
|
80a66603fb
|
added possibility to compute the 'downward closure' of a polytope only with respect to a set of dimensions
|
7 years ago |
|
TimQu
|
136084af75
|
started implementing deterministic scheduler finding approach for multi-objective model checking
|
7 years ago |
|
dehnert
|
4134630fa6
|
adding gap output
|
7 years ago |
|
dehnert
|
4f4d1f4423
|
do not scale precision
|
7 years ago |
|
dehnert
|
386f0b2e47
|
fixing bug in scheduler improvement step of policy iteration for games
|
7 years ago |
|
dehnert
|
2aff2e9382
|
adding some more timing output
|
7 years ago |
sjunges
|
79bb6734ed
|
compile and link parsers in seperate binary
|
7 years ago |
|
sjunges
|
6dfce6a405
|
extended counterexamples towards expected rewards, and moved counterexamples to a seperate lib (still in main cli) to slightly accelarate building times
|
7 years ago |
|
dehnert
|
b0047a5a96
|
improving choices in game policy iteration depending on precision of underlying solver
|
7 years ago |
|
Sebastian Junges
|
d1ab260068
|
remove outdated parts in highlevel counterexamplse
|
7 years ago |
|
Sebastian Junges
|
e29e6c7cd2
|
high level counterexamples extended with more options, and improved performance when minimizing over a subset
|
7 years ago |
|
dehnert
|
48f5608157
|
making policy iteration available for game-based abstraction (prototypical for now)
|
7 years ago |
