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.

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