Mavo
|
566cef0f91
|
Started on compiling without Carl
Former-commit-id: 5e0895d7c5
|
10 years ago |
dehnert
|
83c4b1647c
|
solvers now can allocated auxiliary memory
Former-commit-id: 76dc1a1679
|
10 years ago |
dehnert
|
be5fdeb636
|
started working on internal auxiliary storage of solvers
Former-commit-id: d895041c50
|
10 years ago |
dehnert
|
95b95d9c64
|
fixed some minor issues and renamed equation solver methods slightly to make the names a bit more compact
Former-commit-id: de103e19ad
|
10 years ago |
dehnert
|
b1f2c26df0
|
made all instantiations to call MDP model checking with rational numbers
Former-commit-id: d3f8df7804
|
10 years ago |
dehnert
|
9ab33528b4
|
started to fill value iteration implementation in new general min-max solver
Former-commit-id: e54cb8a0f9
|
10 years ago |
dehnert
|
b4e0cabef6
|
started working on general min-max solver that uses an underlying linear equation solver. provided necessary factories. adapted code and removed old min-max solvers
Former-commit-id: c1895472c7
|
10 years ago |
dehnert
|
248b257f20
|
enabled rationals/rational functions in CTMC model checker
Former-commit-id: dc15cd6020
|
10 years ago |
dehnert
|
49f59052f8
|
made model checkers give up possession of matrix to solver when possible
Former-commit-id: 8d689470bd
|
10 years ago |
dehnert
|
00d331ebb4
|
moved linear equation solver factories to the respective solver files (and away from utility). restructured settings in factories and the way they are forwarded to the linear equation solvers. fixed all resulting errors
Former-commit-id: 27e1ae2466
|
10 years ago |
dehnert
|
15a4d4757f
|
added feature to linear equation solver factories to take posession of the matrix to forward it to the solvers
Former-commit-id: ed183f1820
|
10 years ago |
dehnert
|
f3fa90cc37
|
more work towards exact solving
Former-commit-id: 38edbcf2ca
|
10 years ago |
dehnert
|
2096c54b84
|
more explicit instantiations for rational function and some more tests for eigen solver
Former-commit-id: b97e838b22
|
10 years ago |
dehnert
|
f3701f66fb
|
bugfix for symbolic reachability reward computation
Former-commit-id: c197203539
|
10 years ago |
dehnert
|
6810c0d50f
|
fixed bug in computation of instantaneous rewards on DTMCs
Former-commit-id: f15c616d40
|
10 years ago |
dehnert
|
2c23b1ed99
|
fixed bug in sparse DTMC model checker
Former-commit-id: 41d21093c0
|
10 years ago |
dehnert
|
1136ff0d37
|
fixed a failing test (uninitialized data issue)
Former-commit-id: ca0f456ba2
|
10 years ago |
dehnert
|
51402ec853
|
removed measure type and only added measure type to reward/time operators
Former-commit-id: 16e19fe349
|
10 years ago |
dehnert
|
08bed36579
|
fixed an issue in performance tests and renamed all remaining LOG4CPLUS macro invocations to that of storm
Former-commit-id: 8536943978
|
10 years ago |
dehnert
|
b3483211ff
|
alpha version of conditional rewards for dtmc
Former-commit-id: 1adfb3d405
|
10 years ago |
dehnert
|
b46ee5425e
|
started to implement conditional rewards for dtmcs
Former-commit-id: 0400ea21ef
|
10 years ago |
dehnert
|
dc8a5b11e0
|
more refactoring regarding fragment checking
Former-commit-id: fd335f6f8e
|
10 years ago |
dehnert
|
b772c92edb
|
removed reward path formulas. reward path formulas are now just path formulas. this allows some invalid formulas to be constructed, so this now has to be checked dynamically
Former-commit-id: c8527c8e9a
|
10 years ago |
dehnert
|
3727018ef4
|
added functionality to sparse MDP helper to compute until probabilities just for maybe states (and produce the corresponding scheduler)
Former-commit-id: 79aae02a13
|
10 years ago |
dehnert
|
8f087597cc
|
more work towards proper scheduler generation
Former-commit-id: ee6237ef49
|
10 years ago |
dehnert
|
bdcd4b26a3
|
refactoring early termination and solve goals and bounds
Former-commit-id: 123835f655
|
10 years ago |
dehnert
|
dee44056d1
|
work towards generating schedulers (and some other related stuff)
Former-commit-id: 23cbcb5fb5
|
10 years ago |
dehnert
|
1308b91fda
|
adapted canHandle in model checker interface to CheckTask
Former-commit-id: 7505152ca3
|
10 years ago |
dehnert
|
4367bdb378
|
properly introduced CheckTask in all model checkers and made it compile again (+ functional tests working)
Former-commit-id: d44db3c342
|
10 years ago |
dehnert
|
85adfe9df2
|
more replacement work in interfaces
Former-commit-id: 54839e6e0d
|
10 years ago |
dehnert
|
ecfff3d2f9
|
in the spirit of JP: up
Former-commit-id: 3d7982c083
|
10 years ago |
dehnert
|
16be4f9adc
|
replace in model checker interface (part 2)
Former-commit-id: d66f96a1d5
|
10 years ago |
dehnert
|
d459fb5b92
|
replace in model checker interface (part 1)
Former-commit-id: 110251b010
|
10 years ago |
dehnert
|
5b60585b8a
|
replaced boost::optional<std::string>() by boost::none
Former-commit-id: 48e79b4648
|
10 years ago |
dehnert
|
b1c103811b
|
conditional probabilities in MDPs should now also work in the min-case
Former-commit-id: 9b3c22470b
|
10 years ago |
dehnert
|
3e38e73efe
|
conditional probabilities in MDPs (Baier method) available in sparse MDP model checker
Former-commit-id: 76136c5e72
|
10 years ago |
dehnert
|
756b2c5e30
|
added globally operator to functionality of hybrid/symbolic MDP model checkers
Former-commit-id: 2672333544
|
10 years ago |
dehnert
|
135dfb27b1
|
added globally operator to funcationlity of sparse MDP model checker
Former-commit-id: c74160579b
|
10 years ago |
dehnert
|
d42f52d983
|
all DTMC model checkers now support checking globally formulas
Former-commit-id: b330937007
|
10 years ago |
dehnert
|
84205a0bf6
|
refined computation of conditional probs a bit. Sebastian, if you're reading this: shouldn't you be working? :)
Former-commit-id: 83f6dbb8d2
|
10 years ago |
dehnert
|
33757633c8
|
first version of conditional probabilities for (non-parametric) DTMCs a la Baier
Former-commit-id: b57dfab024
|
10 years ago |
dehnert
|
645f130a62
|
introduced long-run average reward formula
Former-commit-id: 00fac9ad4b
|
11 years ago |
sjunges
|
1e1400d68d
|
merge
Former-commit-id: eb9efc4bb2
|
11 years ago |
dehnert
|
0708672a68
|
removed ite for ADDs as this operation should be formed with a BDD as the first argument. as a compensation, we provide a version of ite that takes a BDD and two ADDs and returns the corresponding ADD
Former-commit-id: 720dc3a9c4
|
11 years ago |
dehnert
|
b7ea918d1b
|
update to latest version of sylvan and accompanying changes (mostly because 0 * inf = nan in IEEE754)
Former-commit-id: 828e13307f
|
11 years ago |
dehnert
|
f8fc39870a
|
hybrid and symbolic model checkers working with sylvan
Former-commit-id: d01b92e328
|
11 years ago |
dehnert
|
7376eaf866
|
made symbolic MDP model checker tests work
Former-commit-id: e2e0d07a55
|
11 years ago |
dehnert
|
7f75db2790
|
ADD iterator working for sylvan. enabled more tests for sylvan. symbolic Dtmc model checker now working.
Former-commit-id: b11b2f7476
|
11 years ago |
dehnert
|
009dabf2f1
|
started cleanining up
Former-commit-id: 3db6fbc1b2
|
11 years ago |
dehnert
|
a258d1ab48
|
restructured ODD to be independent of the DD library being used
Former-commit-id: 83f08ba203
|
11 years ago |