dehnert
45f137face
Prepared stub for Long-Run Average computation for Markov automata.
Former-commit-id: fef601a81d
12 years ago
dehnert
775382fa91
Added option to encode reachability of a target state for SAT-based minimal command counterexample generation. Fixed bug in vector-based set.
Former-commit-id: 7c2ea76902
12 years ago
dehnert
ad0bba6223
Started work on including reachability encoding in SAT-based counterexample generator.
Former-commit-id: 739b8850f0
12 years ago
dehnert
ea7f48cff6
Introduced solver header in utility to return standard solvers when requested.
Former-commit-id: 66bba17785
12 years ago
dehnert
a229b9b322
Refactored MILP-based command generator to use a general LpSolver interface, so other LP solvers may be used when needed.
Former-commit-id: 203ad6a499
12 years ago
dehnert
9f7a0f1354
Started abstracting LP solvers into a common interface. This way, we have more freedom to target different LP solvers easily and can avoid licensing problems.
Former-commit-id: badba812a1
12 years ago
dehnert
101c39f365
Added correct detection of states that possess infinite exptected time to reach a given goal set.
Former-commit-id: 4bc605d89d
12 years ago
dehnert
daea775263
Now rates get correctly transformed to probabilities + exit rates for Markov automata.
Former-commit-id: bf5ccfa813
12 years ago
dehnert
f1a9b1e602
First version of minimum expected time for Markov automata.
Former-commit-id: 6053be896e
12 years ago
dehnert
2cbdf56267
Fixed some bugs in bit vector and vector set that prevented the MEC decomposition from functioning correctly.
Former-commit-id: 51b6d7eb18
12 years ago
dehnert
bfb416687f
Bugfix for Markov automaton parser. Number of choices now gets computed correctly in the presence of deadlock states.
Former-commit-id: afd996d4a3
12 years ago
dehnert
e885603d92
Added new Markov automaton example.
Former-commit-id: abeb0259e4
12 years ago
dehnert
f35ac73547
Splitted VectorSet in header/source file which caused certain minor changes in its interface. Fixed some issues in the Markov automaton parser and made it substantially faster by dropping sscanf. This however introduces other limitations that need to be addressed in the future.
Former-commit-id: 44eb4aabc9
12 years ago
dehnert
5a9d778a23
First version of MEC decomposition for nondeterministic models.
Former-commit-id: 45f67b2a16
12 years ago
dehnert
b9130180ee
Rough sketch of MEC decomposition.
Former-commit-id: 027b58d380
12 years ago
dehnert
f287b7e760
Further steps towards implementation of MEC decomposition.
Former-commit-id: 8166b3b923
12 years ago
dehnert
bd367f89c7
Enabled model checking of PCTL properties for symbolic models.
Former-commit-id: a8e2fc6a92
12 years ago
dehnert
eca717759a
Added functionality to apply a scheduler to a Markov automaton.
Former-commit-id: 2121c61b09
12 years ago
dehnert
c5ff387b98
Merge branch 'master' into imca
Conflicts:
src/models/AbstractModel.h
Former-commit-id: f94c912331
12 years ago
dehnert
e31c3bfb17
Added an important comment.
Former-commit-id: 79d8280d83
12 years ago
dehnert
360b506afe
Sparse MDP model checker now correctly computes (memoryless) schedulers for Until and Reachability Reward formulas.
Former-commit-id: c756093fd4
12 years ago
dehnert
9e941e6b4a
Added scheduler classes. Added method to model classes that applies a scheduler.
Former-commit-id: 73a4be11b2
12 years ago
dehnert
09f192b40f
Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.
Former-commit-id: 4596ba71ec
12 years ago
dehnert
1c594d02f5
Added check in Markov automaton parser to ensure the Markovian choice is the first one for each state. This way only the Markovian states need to be stored and by convention their first choice is the Markovian one.
Former-commit-id: 0cca1bb2c7
12 years ago
dehnert
66f15efbc6
Fixed memory bug in Markov automaton parser.
Former-commit-id: 444b834b91
12 years ago
dehnert
d725a3f898
Removed bit vector for storing markovian choices of MA. From now on, the first choice of a hybrid/Markovian state is the Markovian one.
Former-commit-id: 6b646597dc
12 years ago
David_Korzeniewski
9e66447eb2
Add "lib" prefix for z3 only on Windows
Former-commit-id: bdfa503070
12 years ago
dehnert
cebda374d1
Further step towards Markov automata parser.
Former-commit-id: 33e4634743
12 years ago
dehnert
c02f4e2adc
Markov Automata transitions can now be parsed. Next up: a parser that combines transition and label parsing for Markov automata.
Former-commit-id: 77db051f1f
12 years ago
dehnert
873373eb4e
Further work on explicit MarkovAutomaton parser.
Former-commit-id: 19fbff695b
12 years ago
dehnert
77cabe1948
Started implementing a parser for an explicit format for Markov automata. This commit breaks things, so don't pull if you want to have a running version of this branch.
Former-commit-id: 8a9e9d0c2d
12 years ago
David_Korzeniewski
4fcd4c5961
Merge remote-tracking branch 'remotes/origin/master'
Former-commit-id: ed6cbfed23
12 years ago
David_Korzeniewski
7c0dd5eaf5
Fixed build errors on Windows
Former-commit-id: 10929f075d
12 years ago
dehnert
bc94f69c0b
Resolved some ambiguities that produced problems under Linux. Added option USE_LIBCXX to CMakeLists.txt to also use libc++ under Linux.
Former-commit-id: 2e06d7adf6
12 years ago
dehnert
4550422fac
Added formula support for PRISM models. ExplicitModelAdapter now properly checks for out-of-bound values for integer variables.
Former-commit-id: 86439306b9
12 years ago
dehnert
5cd18c1cf5
Resolved some ambiguities that produced problems under Linux. Added option USE_LIBCXX to CMakeLists.txt to also use libc++ under Linux.
Former-commit-id: f2f7bb6d80
12 years ago
dehnert
d43318afd8
Added first version of MarkovAutomaton class.
Former-commit-id: c211dd9bf4
12 years ago
dehnert
78d5f89ea2
Added formula support for PRISM models. ExplicitModelAdapter now properly checks for out-of-bound values for integer variables.
Former-commit-id: d990e1b388
12 years ago
dehnert
141fdca6d7
Added initial version of MarkovAutomaton class.
Former-commit-id: 099b8b4a22
12 years ago
dehnert
4cdf1e6b7a
Fixed warning resulting from wrong initialization order.
Former-commit-id: b773000369
12 years ago
masawei
94d8a46b1d
Fixed some compile errors originating from the introductionof the new storm::storage::VectorSet.
- Also handled the case of a missing --prctl while using the counterexample generation.
- Remark: Some documentation for the VectorSet would have been nice.
Former-commit-id: c687b67454
12 years ago
masawei
afb0b19c27
All merge conflicts resolved.
Also one small change I forgot before the merge:
- The counterexample generation again uses the --prctl option to aquire its formulas.
Former-commit-id: f3a415d750
12 years ago
masawei
8ed3759074
Merge branch 'critSubsysMerge'
Conflicts:
src/utility/StormOptions.cpp
Former-commit-id: 924ecb35f7
12 years ago
masawei
af0601c453
Made several changes.
- Fixed the infinite loop bug that occured when giving a filepath pointing to a directory instead of a file.
- The BitVector to Dtmc subsystem converter now supports an optional choice labeling.
- The output of the modelchecker to the log file is now suppressed while doing a counterexample generation.
- It is now possible to add more atomic propositions to the AtomicPropositionLabeling than previously declared (at the cost of one reserve per added ap beyond the maximum).
The maximum is then increased accordingly.
|-> As a result the state added for the Dtmc subsystem has now its own label.
Next up: Merge.)
Former-commit-id: 74c92aaea1
12 years ago
masawei
e3e02ecce2
Made counterexample generation output usable.
-std::cout gives enough information to understand what th result of the generaton is.
-Added another argument to --counterExample specifying a directory to write .dot files containing the critical subsystems (as Dtmc) to.
-Cleaned up some logging output of the counterexample generationn.
Next up: Merging.
Former-commit-id: feb4323052
12 years ago
masawei
393a72d56f
Added handling of state and transition rewards to getSubDtmc().
Remark: I don't quite get the optional choice labeling in Dtmcs.
Whats its purpose?
Why is it undocumented in the Dtmc constructor, not supported by the parser but needed nevertheless?
Next up: Pretty up counterexample generation output.
Former-commit-id: c04063b608
12 years ago
masawei
ee1c1eb9b6
First implementation of the BitVector to Dtmc subsystem converter in Dtmc.h
-Had to add a addState function to AtomicPropositionLabeling to be able to throw out the unneeded states using the substates constructor while at the end adding the absorbing state and its label.
An alternative for that would be to provide a constructor taking the mapping and the single labelings vector as well as a getter for the single labelings.
-The --counterexample command now only uses the pctl file given as argument to it and therefore it is now superflous to give the --prctl command in that case.
-Also fixed a bug in the filter constructor of the BitVector.
Now it copies all bit values specified by the filter to the correct index of new instance instead of all to index 0.
Next up: Handle the optionals of the Dtmc when creating the sub-Dtmc.
Former-commit-id: b45ee94cb2
12 years ago
dehnert
13d66a504f
(Hopefully) Finally made cuts correct. Luckily, this even improves performance on some models.
Former-commit-id: 0ca3c9ed60
12 years ago
masawei
a98310a723
Some code revisions.
Former-commit-id: 639afbe825
12 years ago
dehnert
a33717787c
Bugfixes for new set class.
Former-commit-id: 10d9632922
12 years ago