EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||||||
|
Katoen, J.P. and van de Pol, J.C. and Stoelinga, M.I.A. and Timmer, M.
(2010)
A linear process-algebraic format for probabilistic systems with data.
In: Application of Concurrency to System Design, Tenth International Conference on, 21-25 Jun 2010, Braga, Portugal.
pp. 213-222.
IEEE Computer Society.
ISSN 1550-4808
ISBN 978-0-7695-4066-5
Full text available as:
Official URL: http://dx.doi.org/10.1109/ACSD.2010.18 ![]() AbstractThis 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||||||
