EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

19883 Confluence reduction for probabilistic systems

Home Policy Brochure Browse Search User Area Contact Help

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:

PDF

105 Kb

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 Paper (Abstract, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
Research Project:	SYRUP: SYmbolic RedUction of Probabilistic Models, ROCKS: RigorOus dependability analysis using model ChecKing techniques for Stochastic systems, Quasimodo: Quantitative System Properties in Model-Driven-Design of Embedded Systems
Uncontrolled Keywords:	Confluence, State space reduction, Branching probabilistic bisimulation, Probabilistic automata, Probabilistic process algebra
ID Code:	19883
Status:	Published
Deposited On:	04 April 2011
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item