Generating Compact MTBDD-Representations from Probmela Specifications

  • Authors:
  • Frank Ciesinski;Christel Baier;Marcus Größer;David Parker

  • Affiliations:
  • Institute for Theoretical Computer Science, Technical University Dresden, Germany;Institute for Theoretical Computer Science, Technical University Dresden, Germany;Institute for Theoretical Computer Science, Technical University Dresden, Germany;Oxford University Computing Laboratory, Oxford, UK

  • Venue:
  • SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The purpose of the paper is to provide an automatic transformation of parallel programs of an imperative probabilistic guarded command language (called Probmela) into probabilistic reactive module specifications. The latter serve as basis for the input language of the symbolic MTBDD-based probabilistic model checker PRISM, while Probmelais the modeling language of the model checker LiQuorwhich relies on an enumerative approach and supports partial order reduction and other reduction techniques. By providing the link between the model checkers PRISMand LiQuor, our translation supports comparative studies of different verification paradigms and can serve to use the (more comfortable) guarded command language for a MTBDD-based quantitative analysis. The challenges were (1) to ensure that the translation preserves the Markov decision process semantics, (2) the efficiency of the translation and (3) the compactness of the symbolic BDD-representation of the generated PRISM-language specifications.