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.

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