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.

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