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.

174 lines
8.9 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.4.x
  6. -------------
  7. ## Version 1.4.2 (under development)
  8. - n.a.
  9. ### Version 1.4.1 (2019/12)
  10. - Implemented long run average (LRA) computation for DTMCs/CTMCs via value iteration and via gain/bias equations.
  11. - Added several LRA related settings in a new settings module. Note that `--minmax:lramethod` has been replaced by `--lra:nondetmethod`.
  12. ### Version 1.4.0 (2019/11)
  13. - Added support for multi-dimensional quantile queries.
  14. - Added support for multi-objective model checking under pure (deterministic) schedulers with bounded memory using `--purescheds`.
  15. - Allow to quickly check a benchmark from the [Quantitative Verification Benchmark Set](http://qcomp.org/benchmarks/) using the `--qvbs` option.
  16. - Added script `resources/examples/download_qvbs.sh` to download the QVBS.
  17. - If an option is unknown, Storm now suggests similar option names.
  18. - Flagged several options as 'advanced' to clean up the `--help`-message. Use `--help all` to display a complete list of options.
  19. - Support for parsing of exact time bounds for properties, e.g., `P=? [F=27 "goal"]`.
  20. - Export of optimal schedulers when checking MDPs with the sparse engine (experimental). Use `--exportscheduler <filename>`.
  21. - PRISM language: Support for the new `round` operator.
  22. - PRISM language: Improved error messages of the parser.
  23. - JANI: Allow bounded types for constants.
  24. - JANI: Support for non-trivial reward accumulations.
  25. - JANI: Fixed support for reward expressions over non-transient variables.
  26. - DRN: Added support for exact parsing and action-based rewards.
  27. - DRN: Support for placeholder variables which allows to parse recurring rational functions only once.
  28. - Fixed sparse bisimulation of MDPs (which failed if all non-absorbing states in the quotient are initial).
  29. - Support for export of MTBDDs from Storm.
  30. - Support for k-shortest path counterexamples (arguments `-cex --cextype shortestpath`)
  31. - New settings module `transformation` for Markov chain transformations. Use `--help transformation` to get a list of available transformations.
  32. - Support for eliminating chains of Non-Markovian states in MAs via `--eliminate-chains`.
  33. - Export to dot format allows for maximal line width in states (argument `--dot-maxwidth <width>`)
  34. - `storm-conv` can now apply transformations on a prism file.
  35. - `storm-pars`: Enabled building, bisimulation and analysis of symbolic models.
  36. - `storm-dft`: Support partial-order for state space generation.
  37. - `storm-dft`: Compute lower and upper bounds for number of BE failures via SMT.
  38. - `storm-dft`: Allow to set relevant events which are not set to Don't Care.
  39. - `storm-dft`: Support for constant failed BEs. Use flag `--uniquefailedbe` to create a unique constant failed BE.
  40. - `storm-dft`: Support for probabilistic BEs via PDEPs.
  41. - Fixed linking with Mathsat on macOS.
  42. - Fixed linking with IntelTBB for GCC.
  43. - Fixed compilation for macOS Mojave and higher.
  44. - Several bug fixes.
  45. Version 1.3.x
  46. -------------
  47. ## Version 1.3.0 (2018/12)
  48. - Slightly improved scheduler extraction
  49. - Environments are now part of the c++ API
  50. - Heavily extended JANI support, in particular:
  51. * arrays, functions, state-exit-rewards (all engines)
  52. * indexed assignments, complex reward expressions (sparse engine)
  53. * several jani-related bug fixes
  54. - New binary `storm-conv` that handles conversions between model files
  55. - New binary `storm-pomdp` that handles the translation of POMDPs to pMCs.
  56. - Maximal progress assumption is now applied while building Markov Automata (sparse engine).
  57. - Improved Unif+ implementation for Markov Automata, significantly reduced memory consumption.
  58. - Added support for expected time properties for discrete time models
  59. - Bug fix in the parser for DRN (MDPs and MAs might have been affected).
  60. - `storm-gspn`: Improved .pnpro parser
  61. - `storm-gspn`: Added support for single/infinite/k-server semantics for GSPNs given in the .pnpro format
  62. - `storm-gspn`: Added option to set a global capacity for all places
  63. - `storm-gspn`: Added option to include a set of standard properties when converting GSPNs to jani
  64. - `storm-pars`: Added possibility to compute the extremal value within a given region using parameter lifting
  65. - `storm-dft`: DFT translation to GSPN supports Don't Care propagation
  66. - `storm-dft`: Support DFT analysis via transformation from DFT to GSPN to JANI
  67. - `storm-dft`: Added SMT encoding for DFTs
  68. - `storm-dft`: Improved Galileo and JSON parser
  69. - Several bug fixes
  70. - Storm uses the `master14` branch of carl from now on
  71. ### Comparison with Version 1.2.0 (details see below)
  72. - Heavily extended JANI-support
  73. - New binary `storm-conv` that handles conversion between model files
  74. - New binary `storm-pomdp` that handles the translation of POMDPs to pMCs.
  75. - `storm-gspn` improved
  76. - Sound value iteration
  77. Version 1.2.x
  78. -------------
  79. ### Version 1.2.3 (2018/07)
  80. - Fix in version parsing
  81. ### Version 1.2.2 (2018/07)
  82. - Sound value iteration (SVI) for DTMCs and MDPs
  83. - Topological solver for linear equation systems and MinMax equation systems (enabled by default)
  84. - Added support for expected total rewards in the sparse engine
  85. - By default, iteration-based solvers are no longer aborted after a given number of steps.
  86. - Improved export for jani models
  87. - A fix in parsing jani properties
  88. - Several extensions to high-level counterexamples
  89. - `storm-parsers` extracted to reduce linking time
  90. - `storm-counterexamples` extracted to reduce linking time
  91. - `storm-dft`: improvements in Galileo parser
  92. - `storm-dft`: test cases for DFT analysis
  93. - Improved Storm installation
  94. - Several bug fixes
  95. ### Version 1.2.1 (2018/02)
  96. - Multi-dimensional reward bounded reachability properties for DTMCs.
  97. - `storm-dft`: transformation of DFTs to GSPNs
  98. - Several bug fixes
  99. ### Version 1.2.0 (2017/12)
  100. - C++ api changes: Building model takes `BuilderOptions` instead of extended list of Booleans, does not depend on settings anymore.
  101. - `storm-cli-utilities` now contains cli related stuff, instead of `storm-lib`
  102. - Symbolic (MT/BDD) bisimulation
  103. - Fixed issue related to variable names that can not be used in Exprtk.
  104. - DRN parser improved
  105. - LP-based MDP model checking
  106. - Sound (interval) value iteration
  107. - Support for Multi-objective multi-dimensional reward bounded reachability properties for MDPs.
  108. - RationalSearch method to solve equation systems exactly
  109. - WalkerChae method for solving linear equation systems with guaranteed convergence
  110. - Performance improvements for sparse model building
  111. - Performance improvements for conditional properties on MDPs
  112. - Automatically convert MA without probabilistic states into CTMC
  113. - Fixed implemention of Fox and Glynn' algorithm
  114. - `storm-pars`: support for welldefinedness constraints in mdps.
  115. - `storm-dft`: split DFT settings into IO settings and fault tree settings
  116. - `storm-dft`: removed obsolete explicit model builder for DFTs
  117. - Features for developers:
  118. * Solvers can now expose requirements
  119. * unbounded reachability and reachability rewards now correctly respect solver requirements
  120. * Environment variables (such as the solver precisions) can now be handled more flexible
  121. * changes to Matrix-Vector operation interfaces, in particular fixed some issues with the use Intel TBB
  122. Version 1.1.x
  123. -------------
  124. ### Version 1.1.0 (2017/8)
  125. - Support for long-run average rewards on MDPs and Markov automata using a value-iteration based approach.
  126. - Storm can now check MDPs and Markov Automata (i.e. MinMax equation systems) via Linear Programming.
  127. - Parametric model checking is now handled in a separated library/executable called `storm-pars`.
  128. - Wellformedness constraints on PMCs:
  129. * include constraints from rewards
  130. * are in smtlib2
  131. * fixed
  132. * computation of only constraints without doing model checking is now supported
  133. - Fix for nested formulae
  134. - JANI: Explicit engine supports custom model compositions.
  135. - Support for parsing/building models given in the explicit input format of IMCA.
  136. - Storm now overwrites files if asked to write files to a specific location.
  137. - Changes in build process to accommodate for changes in carl. Also, more robust against issues with carl.
  138. - `USE_POPCNT` removed in favor of `FORCE_POPCNT`. The popcnt instruction is used if available due to `march=native`, unless portable is set.
  139. Then, using `FORCE_POPCNT` enables the use of the SSE 4.2 instruction
  140. Version 1.0.x
  141. -------------
  142. ### Version 1.0.1 (2017/4)
  143. - Multi-objective model checking support now fully included
  144. - Several improvements in parameter lifting
  145. - Several improvements in JANI parsing
  146. - Properties can contain model variables
  147. - Support for rational numbers/functions in decision diagrams via sylvan
  148. - Elimination-based solvers (exact solution) for models stored as decision diagrams
  149. - Export of version and configuration to cmake
  150. - Improved building process
  151. ### Version 1.0.0 (2017/3)
  152. Start of this changelog