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.

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