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.

128 lines
6.0 KiB

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