Confluence Reduction for Probabilistic Systems
Timmer, Mark and Stoelinga, Mariëlle and Pol, Jaco van de (2011) Confluence Reduction for Probabilistic Systems. In: 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2011, 26 March - 3 April 2011, Saarbrücken, Germany (pp. pp. 311-325).
PDF (Author's version)
PDF (Publisher's version)
Restricted to UT campus only : Request a copy
|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.
|Item Type:||Conference or Workshop Item|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/75536|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 277817