How fast and fat is your probabilistic model checker? an experimental performance comparison

  • Authors:

  • David N. Jansen;Joost-Pieter Katoen;Marcel Oldenkamp;Mariëlle Stoelinga;Ivan Zapreev

  • Affiliations:

  • MOVES Group, RWTH, Aachen, Germany and ICIS, Radboud University, Nijmegen, The Netherlands;MOVES Group, RWTH, Aachen, Germany and FMT Group, University of Twente, Enschede, The Netherlands;FMT Group, University of Twente, Enschede, The Netherlands;FMT Group, University of Twente, Enschede, The Netherlands;MOVES Group, RWTH, Aachen, Germany and FMT Group, University of Twente, Enschede, The Netherlands

  • Venue:
  • HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The study considers the model checkers ETMCC, MRMC, PRISM (sparse and hybrid mode), YMER and VESTA, and focuses on fully probabilistic systems. Several of our experiments show significantly different run times and memory consumptions between the tools-up to various orders of magnitude--without, however, indicating a clearly dominating tool. For statistical model checking YMER clearly prevails whereas for the numerical tools MRMC and PRISM (sparse) are rather close.