EEMCS EPrints Service
Timmer, M. and van de Pol, J.C. and Stoelinga, M.I.A. (2010) Confluence reduction for probabilistic systems. In: Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory, 4 Sep 2010, Paris, France. pp. 87-90. Eindhoven University of Technology. ISBN not assigned
Full text available as:
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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item