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.

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