Changes between Version 32 and Version 33 of News


Ignore:
Timestamp:
Jan 12, 2011, 1:14:33 PM (8 years ago)
Author:
Viet Yen Nguyen
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • News

    v32 v33  
    44
    55= News =
     6
     7==== 12.01.2011 ====
     8A new MRMC version is released. The changes are:
     9    * a new algorithm to compute time-bounded reachability probabilities
     10      for non-uniform CTMDPIs. This feature is based on "Continuous-Time
     11      Stochastic Games with Time-Bounded Reachability" by Brazdil et al.
     12    * Bug fixes for time-bounded reachability algorithm for uniform CTMDPIs
     13    * Improved partition refinement algorithm for lumping. The new algorithm
     14      uses a variant of quicksort instead of splay trees for efficient
     15      splitting.
     16
     17Besides this, we worked on improved data structure for sparse matrices
     18for this version; however, while it provided improvements in bisimulation
     19minimisation, it led to serious degradation in simulation. Therefore, we
     20abandoned this plan.
    621
    722==== 11.11.2009 ====