A Linear Process-Algebraic Format for Probabilistic Systems with Data

Authors:
Joost-Pieter Katoen;Jaco van_de_ Pol;Mariëlle Stoelinga;Mark Timmer
Affiliations:
-;-;-;-
Venue:
ACSD '10 Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design
Year:
2010

Citing 0
Cited 3

Confluence reduction for probabilistic systems

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Partial order methods for statistical model checking and simulation

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A linear process-algebraic format with data for probabilistic automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and data-dependent probabilistic choice in a fully symbolic manner, paving the way to the symbolic analysis of parameterised probabilistic systems.