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.

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