EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

19088 Confluence Reduction for Probabilistic Systems (extended version)

Home Policy Brochure Browse Search User Area Contact Help

Timmer, M. and Stoelinga, M.I.A. and van de Pol, J.C. (2010) Confluence Reduction for Probabilistic Systems (extended version). Technical Report 1011.2314, ArXiv e-prints.

Full text available as:

PDF

323 Kb

Official URL: http://arxiv.org/abs/1011.2314v1

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:	Internal Report (Technical Report)
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:	19088
Deposited On:	15 December 2010
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item