20 Commits (9e64e998f37d95c488b499dbda11c2aaf05decbd)

Author SHA1 Message Date
dehnert b94e978843 another round of fixes 10 years ago
dehnert dc2735b6ff moved some template parameters from class scope to function scope 10 years ago
sjunges f85d28325e Further work towards faster and more modular compilation 10 years ago
dehnert b56766e993 more work on reward model that turned out to be refactoring in disguise 10 years ago
dehnert dcd42d5653 started reworking reward models 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. 10 years ago
dehnert 51becda4b3 Commit to switch workplace. 11 years ago
dehnert 94902388c7 Some minor changes, still doesn't compile. 11 years ago
dehnert 0e87ccac9d Tried to pave the way for generic blocks for decompositions, but I don't know whether this is the way to go. 11 years ago
dehnert 8f7c9d5c25 Adapted SCC-interface such that it can also be given a matrix instead of a model. More work on SCC-based mc. 11 years ago
dehnert d40573640f Dropped our current Tarjan-implementation in favour of the path-based algorithm by Gabow (and others) as this seems to perform a lot better (at when comparing our implementations). 11 years ago
PBerger 57b6208eee Added a pseudo model which can be constructed from only a matrix to look and behave like a model for use in Decomposition classes 11 years ago
dehnert f32853b6aa Beautified remaining storage classes a bit. 12 years ago
dehnert 35d16a1191 Replaced VectorSet bei boost::container::flat_set, which does essentially the same. Fixed a bug in sparse matrix creation. 12 years ago
dehnert 101c39f365 Added correct detection of states that possess infinite exptected time to reach a given goal set. 12 years ago
dehnert f287b7e760 Further steps towards implementation of MEC decomposition. 12 years ago
masawei c30d6d307e Figured out how to explicitly instantiate templates. 12 years ago
dehnert 09f192b40f Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata. 12 years ago