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.
Original language | Undefined |
---|---|
Title of host publication | Application of Concurrency to System Design, Tenth International Conference on |
Editors | L. Gomes, V. Khomenko, J.M. Fernandes |
Place of Publication | Los Alamitos |
Publisher | IEEE |
Pages | 213-222 |
Number of pages | 10 |
ISBN (Print) | 978-0-7695-4066-5 |
DOIs | |
Publication status | Published - Jun 2010 |
Event | 10th International Conference on Application of Concurrency to System Design, ACSD 2010 - Braga, Portugal Duration: 21 Jun 2010 → 25 Jun 2010 Conference number: 10 |
Publication series
Name | |
---|---|
Publisher | IEEE Computer Society Press |
ISSN (Print) | 1550-4808 |
Conference
Conference | 10th International Conference on Application of Concurrency to System Design, ACSD 2010 |
---|---|
Abbreviated title | ACSD |
Country/Territory | Portugal |
City | Braga |
Period | 21/06/10 → 25/06/10 |
Keywords
- METIS-270919
- IR-72425
- Probabilistic process algebra
- Linearisation
- Data-dependent probabilistic choice
- EC Grant Agreement nr.: FP7/214755
- EWI-18161
- symbolic transformation
- Probabilistic automata
- FMT-PA: PROCESS ALGEBRAS
- FMT-PM: PROBABILISTIC METHODS
- CR-F.4
- EC Grant Agreement nr.: FP7-ICT-2007-1