sp
/
tempest
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
1061 Commits
1 Branch
0 Tags
187 MiB
Tree: 8a47d03cf7
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '8a47d03cf7'
${ noResults }
Commit Graph

1061 Commits (8a47d03cf7e36d1165e8e8c59df2e8c2dfe70be4)
 

Author SHA1 Message Date
dehnert 8a47d03cf7 Started to rework the interface of the sparse matrix class.
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.
11 years ago
dehnert d5cadc0f4b Finalized interface of bit vector. Added unit tests for all methods of the bit vector.
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.
11 years ago
dehnert a7c8c3a1a3 Added checklist file for refactoring classes.
11 years ago
dehnert 07fbff7a07 Started refactoring bit vector class.
11 years ago
dehnert 716f3366fc Added configuration file for astyle (a code-formatting tool) that is tailored to our formatting style.
11 years ago
dehnert e2cec086a3 Merge branch 'imca'
11 years ago
dehnert c336fd7ff8 Minor fixes for implementation of GlpkLpSolver if glpk is unavailable.
11 years ago
dehnert 344e1b6dd3 Enabled checking of some untimed properties on Markov automata.
11 years ago
dehnert 3dab26463d Introduced precision for digitization-based techniques as a new parameter.
11 years ago
dehnert ece4085a61 Another bugfix for matrix creation during LRA computation.
11 years ago
dehnert fde78ad759 Bugfix for matrix creation in LRA computation.
11 years ago
dehnert b3601782a9 Added Lp Solver class for glpk and added it as an option in CMakeLists.txt.
11 years ago
dehnert 0a89d65f93 Started refactoring Markov automaton model checker.
11 years ago
dehnert 18711c01a3 First working version of time-bounded reachability for Markov automata.
11 years ago
dehnert 2ef0405104 Merge branch 'master' into imca
11 years ago
dehnert dce43d78e7 Started implementation of time-bounded reachability of Markov automata.
11 years ago
masawei 175e852956 Resolved problems resulting from merge.
11 years ago
masawei eeb7a21cf9 Merge branch 'reduceCompiletime'
11 years ago
dehnert 281140c8ff Sketched algorith outline for time-bounded reachability for Markov automata.
11 years ago
dehnert dabfb5e1dd First working version of LRA computation for Markov automata.
11 years ago
dehnert 339b598694 Enabled computation of LRA for individual maximal end components. It remains to compute the overall LRA value using the values for the individual MECs.
11 years ago
dehnert 45f137face Prepared stub for Long-Run Average computation for Markov automata.
11 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.
11 years ago
dehnert ad0bba6223 Started work on including reachability encoding in SAT-based counterexample generator.
11 years ago
dehnert ea7f48cff6 Introduced solver header in utility to return standard solvers when requested.
11 years ago
dehnert a229b9b322 Refactored MILP-based command generator to use a general LpSolver interface, so other LP solvers may be used when needed.
11 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.
11 years ago
dehnert 101c39f365 Added correct detection of states that possess infinite exptected time to reach a given goal set.
11 years ago
dehnert daea775263 Now rates get correctly transformed to probabilities + exit rates for Markov automata.
11 years ago
dehnert f1a9b1e602 First version of minimum expected time for Markov automata.
11 years ago
dehnert 2cbdf56267 Fixed some bugs in bit vector and vector set that prevented the MEC decomposition from functioning correctly.
11 years ago
dehnert bfb416687f Bugfix for Markov automaton parser. Number of choices now gets computed correctly in the presence of deadlock states.
11 years ago
dehnert e885603d92 Added new Markov automaton example.
11 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.
11 years ago
dehnert 5a9d778a23 First version of MEC decomposition for nondeterministic models.
11 years ago
dehnert b9130180ee Rough sketch of MEC decomposition.
11 years ago
dehnert f287b7e760 Further steps towards implementation of MEC decomposition.
11 years ago
masawei 84f6bf7104 Added a getBackwardsTransitions() to AbstractNondeterministicModel, since simple transposition does not yield correct results and for the computation of the backwards transitions the nondeterministic choice indices must be known.
11 years ago
dehnert bd367f89c7 Enabled model checking of PCTL properties for symbolic models.
11 years ago
masawei 170306e46d Moved SparseMatrix transposition function from AbstractModel (named: getBackwardsTransitions) to SparseMatrix (named: transpose) where it belongs.
11 years ago
masawei c30d6d307e Figured out how to explicitly instantiate templates.
11 years ago
dehnert eca717759a Added functionality to apply a scheduler to a Markov automaton.
11 years ago
dehnert c5ff387b98 Merge branch 'master' into imca
11 years ago
dehnert e31c3bfb17 Added an important comment.
11 years ago
dehnert 360b506afe Sparse MDP model checker now correctly computes (memoryless) schedulers for Until and Reachability Reward formulas.
11 years ago
dehnert 9e941e6b4a Added scheduler classes. Added method to model classes that applies a scheduler.
11 years ago
dehnert 09f192b40f Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.
11 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.
11 years ago