EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


19229 Confluence Reduction for Probabilistic Systems
Home Policy Brochure Browse Search User Area Contact Help

Timmer, M. and Stoelinga, M.I.A. and van de Pol, J.C. (2011) Confluence Reduction for Probabilistic Systems. In: Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2011, 26 Mar - 3 Apr 2011, Saarbrücken, Germany. pp. 311-325. Lecture Notes in Computer Science 6605. Springer Verlag. ISBN 978-3-642-19834-2

Full text available as:

PDF (Author's version)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
398 Kb
PDF (Publisher's version)
- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
277 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-19835-9_29

Exported to Metis

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 Paper (Full Paper, 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, Quasimodo: Quantitative System Properties in Model-Driven-Design of Embedded Systems, ROCKS: RigorOus dependability analysis using model ChecKing techniques for Stochastic systems
Uncontrolled Keywords:Confluence, State space reduction, Branching probabilistic bisimulation, Probabilistic automata, Probabilistic process algebra
ID Code:19229
Status:Published
Deposited On:04 January 2011
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item