Confluence reduction for probabilistic systems


Timmer, Mark and Pol, Jaco van de and Stoelinga, Mariëlle (2010) Confluence reduction for probabilistic systems. In: 2nd Young Researchers Workshop on Concurrency Theory, 4 September 2010, Paris, France (pp. pp. 87-90).

open access
Abstract:In this presentation we introduce a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We proved 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. We present a case study, demonstrating that significant reductions can be obtained.
Item Type:Conference or Workshop Item
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 275960