You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

87 lines
4.0 KiB

8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
  1. Changelog
  2. ==============
  3. This changelog lists only the most important changes. Smaller (bug)fixes as well as non-mature features are not part of the changelog.
  4. The releases of major and minor versions contain an overview of changes since the last major/minor update.
  5. Version 1.2.x
  6. -------------
  7. ### Version 1.2.2 (to be released)
  8. - `storm-dft`: improvements in Galileo parser
  9. - `storm-dft`: test cases for DFT analysis
  10. - Sound value iteration (SVI) for DTMCs and MDPs
  11. - Topological solver for linear equation systems and MinMax equation systems (enabled by default)
  12. - Added support for expected total rewards in the sparse engine
  13. - `storm-parsers` extracted to reduce linking time
  14. - `storm-counterexamples` extracted to reduce linking time
  15. - Improved export for jani models
  16. - Several extensions to high-level counterexamples
  17. - A fix in parsing jani properties
  18. ### Version 1.2.1 (2018/02)
  19. - Multi-dimensional reward bounded reachability properties for DTMCs.
  20. - `storm-dft`: transformation of DFTs to GSPNs
  21. - Several bug fixes
  22. ### Version 1.2.0 (2017/12)
  23. - C++ api changes: Building model takes `BuilderOptions` instead of extended list of Booleans, does not depend on settings anymore.
  24. - `storm-cli-utilities` now contains cli related stuff, instead of `storm-lib`
  25. - Symbolic (MT/BDD) bisimulation
  26. - Fixed issue related to variable names that can not be used in Exprtk.
  27. - DRN parser improved
  28. - LP-based MDP model checking
  29. - Sound (interval) value iteration
  30. - Support for Multi-objective multi-dimensional reward bounded reachability properties for MDPs.
  31. - RationalSearch method to solve equation systems exactly
  32. - WalkerChae method for solving linear equation systems with guaranteed convergence
  33. - Performance improvements for sparse model building
  34. - Performance improvements for conditional properties on MDPs
  35. - Automatically convert MA without probabilistic states into CTMC
  36. - Fixed implemention of Fox and Glynn' algorithm
  37. - `storm-pars`: support for welldefinedness constraints in mdps.
  38. - `storm-dft`: split DFT settings into IO settings and fault tree settings
  39. - `storm-dft`: removed obsolete explicit model builder for DFTs
  40. - Features for developers:
  41. * Solvers can now expose requirements
  42. * unbounded reachability and reachability rewards now correctly respect solver requirements
  43. * Environment variables (such as the solver precisions) can now be handled more flexible
  44. * changes to Matrix-Vector operation interfaces, in particular fixed some issues with the use Intel TBB
  45. Version 1.1.x
  46. -------------
  47. ### Version 1.1.0 (2017/8)
  48. - Support for long-run average rewards on MDPs and Markov automata using a value-iteration based approach.
  49. - Storm can now check MDPs and Markov Automata (i.e. MinMax equation systems) via Linear Programming.
  50. - Parametric model checking is now handled in a separated library/executable called `storm-pars`.
  51. - Wellformedness constraints on PMCs:
  52. * include constraints from rewards
  53. * are in smtlib2
  54. * fixed
  55. * computation of only constraints without doing model checking is now supported
  56. - Fix for nested formulae
  57. - JANI: Explicit engine supports custom model compositions.
  58. - Support for parsing/building models given in the explicit input format of IMCA.
  59. - Storm now overwrites files if asked to write files to a specific location.
  60. - Changes in build process to accommodate for changes in carl. Also, more robust against issues with carl.
  61. - `USE_POPCNT` removed in favor of `FORCE_POPCNT`. The popcnt instruction is used if available due to `march=native`, unless portable is set.
  62. Then, using `FORCE_POPCNT` enables the use of the SSE 4.2 instruction
  63. Version 1.0.x
  64. -------------
  65. ### Version 1.0.1 (2017/4)
  66. - Multi-objective model checking support now fully included
  67. - Several improvements in parameter lifting
  68. - Several improvements in JANI parsing
  69. - Properties can contain model variables
  70. - Support for rational numbers/functions in decision diagrams via sylvan
  71. - Elimination-based solvers (exact solution) for models stored as decision diagrams
  72. - Export of version and configuration to cmake
  73. - Improved building process
  74. ### Version 1.0.0 (2017/3)
  75. Start of this changelog