dehnert
00e7121bc4
some work towards BDD-based mc.
Former-commit-id: cae0c4421e
10 years ago
dehnert
81100c7afd
debugged and added more tests for prob0/1 for MDPs using BDDs
Former-commit-id: f47fb3631a
10 years ago
dehnert
c70d93f4d3
Qualitative modelchecking algorithms for MDPs using BDDs. Not yet bugfixed.
Former-commit-id: 3215a38c44
10 years ago
dehnert
1a1906f811
Added functional tests for DD-based and sparse computation of states with prob 0 and 1.
Former-commit-id: a62c67c657
10 years ago
dehnert
a1dae8849e
Reworked (sparse) model files: moved them into their own namespace and deleted some functionality that is never used and not that nicely implemented.
Former-commit-id: d4e6df30b5
10 years ago
dehnert
c3c83fbe4f
Fixed some compilation errors.
Former-commit-id: dc626450b8
10 years ago
dehnert
ed6f3dae9f
Renamed the newly added method.
Former-commit-id: 72ea9afb61
11 years ago
dehnert
2437601a85
Added function to compute distances of states to some other set of states.
Former-commit-id: 2bf19c1b2d
11 years ago
dehnert
1c091d7640
Renamed some classes to indicate that only strong bisimulation can be computed. Added option to start with an initial partition that preserves only certain formulas. Added ConstantsComparator concept that is to be used when constants have to be compared with other constants.
Former-commit-id: feacadfa38
11 years ago
dehnert
5aafbae9a0
Minor fixes.
Former-commit-id: c0d75f260e
11 years ago
dehnert
c2dc25a1eb
Started implementing the state elimination procedure.
Former-commit-id: c548a2ec06
11 years ago
dehnert
8864efc980
Added method to determine reachable states. Further work on SCC-based mc.
Former-commit-id: 3a38eafeea
11 years ago
dehnert
77e2693ccc
Further work on SCC-based mc.
Former-commit-id: 4e5c1fb188
11 years ago
PBerger
d2f4c85711
Made changes to comply with new SparseMatrix Interface (YUCK).
Fixed tests, all that stuff.
Former-commit-id: c78de5f8ce
11 years ago
dehnert
db232fe39b
Moved from pair to MatrixEntry as the basic building block of the matrix. Now matrix elements can be accessed in a more readable way.
Former-commit-id: f6514eb0cd
11 years ago
PBerger
47b34171f2
Fixed a typo.
Former-commit-id: b5a3026aa9
11 years ago
sjunges
8ca5ac176e
fixed spelling in comment: breath-first search
Former-commit-id: 21e719734b
11 years ago
dehnert
12743e0a7e
Moved from additional row grouping to the one embedded in the matrix itself.
Former-commit-id: 9d7a1fff10
11 years ago
PBerger
4eef3b0d57
Added an example for SCC related testing which will change soon
Removed unnecessary code from the TopologicalValueIterationMdpPrctlModelChecker.h
Fixed Bugs in graph.h (changes from Sparse Matrix Iterator, it didnt even compile anymore! Unused Code HAUNTS us)
Former-commit-id: 96669adec9
11 years ago
dehnert
5e12a65d67
Adapted performance-critical iterations in graph utility to the iterator formulation with less overhead.
Former-commit-id: 44bf732bb4
11 years ago
dehnert
81cf0e2b22
Added SparseMatrixBuilder class that actually builds the matrices. A call to build() will then generate the matrix. This eliminates superfluous checks in the matrix that slowed down performance.
Former-commit-id: af5d946fb8
11 years ago
dehnert
cf2b84b281
Further work on iterators for sparse matrix.
Former-commit-id: 8e78262161
11 years ago
dehnert
a26f63be30
Finished reworking the sparse matrix implementation. Adapted all other classes to the (partially) new API of the matrix.
Former-commit-id: 2c3b5a5bc3
11 years ago
dehnert
84bd5f3b40
Renamed ConstTemplates to constants. Removed all calls to constGetZero, constGetOne and constGetInfinity by the new names. Created performance test for bit vector iteration.
Former-commit-id: 6d90ec961e
11 years ago
dehnert
30322ec57d
Now officially made the iterator over bit vectors an input iterator so that it can be used for constructing STL containers and other containers.
Former-commit-id: 1bcd8c43b3
11 years ago
dehnert
344e1b6dd3
Enabled checking of some untimed properties on Markov automata.
Former-commit-id: e71aa66c62
11 years ago
masawei
170306e46d
Moved SparseMatrix transposition function from AbstractModel (named: getBackwardsTransitions) to SparseMatrix (named: transpose) where it belongs.
- Fixed one problem marked FIXME in the transpose function. The need for a "sentinel" element was created by an off by one in the prior loop.
- Changed all occurences of SparseMatrix<bool> to SparseMatrix<T>. Now the only two types for which SparseMatrix is instantiated are double and int.
- Compiles again.
|-> Compile time seems to be roughly the same for clean; make all. For incremental builds I haven't tested yet.
Former-commit-id: 6d829e0903
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
PBerger
c242dcbd97
Refactored CMakeLists.txt for better editing and overview
Refactored all Defines for Gurobi, TBB, etc into the storm-config file
Fixed a missing cast int SymbolicModelAdapter.h
Fixed changed iterator structures in SparseMatrix.h
Fixed bugs in CuddUtility.cpp where a 64bit shift was executed on a 32bit literal (1 should be 1ull)
Fixed a Type Error in graph.h
Former-commit-id: 797b4da2eb
12 years ago
Lanchid
6af5ce4860
Another container for which gcc does not support emplace yet...
Former-commit-id: 3914bf9737
12 years ago
dehnert
973e51bacb
Beautified the code a bit.
Former-commit-id: d4b4a738c1
12 years ago
dehnert
b36b460a4e
Added some comments to scheduler guessing.
Former-commit-id: 6a256210a3
12 years ago
dehnert
15542d46da
Changes:
* included small consensus example
* made backward-transition generation more beautiful and versatile
* included Dijkstra search for most probable paths
* included first rough scheduler-guessing (there's room for improvement though)
Former-commit-id: db795fa1bf
12 years ago
dehnert
f44f0ce410
Cleaned interfaces of models from std::shared_ptr. Improved some code in graph utility.
12 years ago
dehnert
c8081c4d34
Fixed wrong step-bounded backward search.
12 years ago
dehnert
64b883f695
Some cleanup in storm.cpp. Refactored and commented the utility module for vector operations.
12 years ago
Lanchid
ec91dcbe2e
Merge branch master into LTLParser
12 years ago
dehnert
307911ca13
Fixed performance tests, they now run fine.
12 years ago
dehnert
3c32eec8e1
Made the prob0/1 algorithms for MDPs share a common backward transition object.
12 years ago
dehnert
fbe1f41213
Removed GraphTransition class, which is now replaced by SparseMatrix in the instances where it was used before. Changed GraphAnalyzer accordingly and adapted tests.
12 years ago
dehnert
ed4c6c8429
Fixed SCC decomposition functions. Added performance tests for GraphAnalyzer.
12 years ago
dehnert
69395face2
Moved creation of SCC-dependency graph into abstract model class. Added functionality to sparse matrix class to not give the number of nonzeros upfront, but to to grow on demand.
12 years ago
dehnert
b28b827362
All methods of GraphAnalyzer:
* commented,
* return values instead of passing result variables by reference.
12 years ago
dehnert
ab11d3c207
Further refactoring of GraphAnalyzer class. Some comments are still missing and GraphAnalyzer should be made a namespace instead of a class with static methods only.
12 years ago
dehnert
fc67cf4e3f
Further refactoring of GraphAnalyzer class.
12 years ago
dehnert
cc7230abb1
Started to refactor graph analyzing to include less pointers and the like. Currently this breaks two tests.
12 years ago
dehnert
d266d9effe
Fixed another bug in sparse matrix. Fixed bug in test.
12 years ago
dehnert
00b4797948
Further refactoring. Other classes are now adapted to the changes in the sparse matrix class.
12 years ago
dehnert
43f11ccc5f
Refactoring of modelchecker folder.
12 years ago
dehnert
102f38322d
Fixed several bugs in several modules (bit vector, parser, etc.). Topological value iteration now works for the consensus protocol and the two dice example.
12 years ago