Confluence Reduction for Probabilistic Systems

  • Mark Timmer
  • Mariëlle Stoelinga
  • Jaco van de Pol
Conference paper

DOI: 10.1007/978-3-642-19835-9_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6605)
Cite this paper as:
Timmer M., Stoelinga M., van de Pol J. (2011) Confluence Reduction for Probabilistic Systems. In: Abdulla P.A., Leino K.R.M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2011. Lecture Notes in Computer Science, vol 6605. Springer, Berlin, Heidelberg

Abstract

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format. A case study demonstrates that significant reductions can be obtained.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mark Timmer
    • 1
  • Mariëlle Stoelinga
    • 1
  • Jaco van de Pol
    • 1
  1. 1.Formal Methods and Tools, Faculty of EEMCSUniversity of TwenteThe Netherlands

Personalised recommendations