A linear process-algebraic format for probabilistic systems with data

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
58 Downloads (Pure)

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 languageUndefined
Title of host publicationApplication of Concurrency to System Design, Tenth International Conference on
EditorsL. Gomes, V. Khomenko, J.M. Fernandes
Place of PublicationLos Alamitos
PublisherIEEE Computer Society Press
Pages213-222
Number of pages10
ISBN (Print)978-0-7695-4066-5
DOIs
Publication statusPublished - Jun 2010
Event10th International Conference on Application of Concurrency to System Design, ACSD 2010 - Braga, Portugal
Duration: 21 Jun 201025 Jun 2010
Conference number: 10

Publication series

Name
PublisherIEEE Computer Society Press
ISSN (Print)1550-4808

Conference

Conference10th International Conference on Application of Concurrency to System Design, ACSD 2010
Abbreviated titleACSD
CountryPortugal
CityBraga
Period21/06/1025/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

Cite this

Katoen, J. P., van de Pol, J. C., Stoelinga, M. I. A., & Timmer, M. (2010). A linear process-algebraic format for probabilistic systems with data. In L. Gomes, V. Khomenko, & J. M. Fernandes (Eds.), Application of Concurrency to System Design, Tenth International Conference on (pp. 213-222). [10.1109/ACSD.2010.18] Los Alamitos: IEEE Computer Society Press. https://doi.org/10.1109/ACSD.2010.18
Katoen, Joost P. ; van de Pol, Jan Cornelis ; Stoelinga, Mariëlle Ida Antoinette ; Timmer, Mark. / A linear process-algebraic format for probabilistic systems with data. Application of Concurrency to System Design, Tenth International Conference on. editor / L. Gomes ; V. Khomenko ; J.M. Fernandes. Los Alamitos : IEEE Computer Society Press, 2010. pp. 213-222
@inproceedings{782f220650c34ad8beaf703163de93e5,
title = "A linear process-algebraic format for probabilistic systems with data",
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.",
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",
author = "Katoen, {Joost P.} and {van de Pol}, {Jan Cornelis} and Stoelinga, {Mari{\"e}lle Ida Antoinette} and Mark Timmer",
note = "See also the extended version, CTIT report TR-CTIT-10-11, http://eprints.eemcs.utwente.nl/17778/",
year = "2010",
month = "6",
doi = "10.1109/ACSD.2010.18",
language = "Undefined",
isbn = "978-0-7695-4066-5",
publisher = "IEEE Computer Society Press",
pages = "213--222",
editor = "L. Gomes and V. Khomenko and J.M. Fernandes",
booktitle = "Application of Concurrency to System Design, Tenth International Conference on",

}

Katoen, JP, van de Pol, JC, Stoelinga, MIA & Timmer, M 2010, A linear process-algebraic format for probabilistic systems with data. in L Gomes, V Khomenko & JM Fernandes (eds), Application of Concurrency to System Design, Tenth International Conference on., 10.1109/ACSD.2010.18, IEEE Computer Society Press, Los Alamitos, pp. 213-222, 10th International Conference on Application of Concurrency to System Design, ACSD 2010, Braga, Portugal, 21/06/10. https://doi.org/10.1109/ACSD.2010.18

A linear process-algebraic format for probabilistic systems with data. / Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette; Timmer, Mark.

Application of Concurrency to System Design, Tenth International Conference on. ed. / L. Gomes; V. Khomenko; J.M. Fernandes. Los Alamitos : IEEE Computer Society Press, 2010. p. 213-222 10.1109/ACSD.2010.18.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - A linear process-algebraic format for probabilistic systems with data

AU - Katoen, Joost P.

AU - van de Pol, Jan Cornelis

AU - Stoelinga, Mariëlle Ida Antoinette

AU - Timmer, Mark

N1 - See also the extended version, CTIT report TR-CTIT-10-11, http://eprints.eemcs.utwente.nl/17778/

PY - 2010/6

Y1 - 2010/6

N2 - 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.

AB - 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.

KW - METIS-270919

KW - IR-72425

KW - Probabilistic process algebra

KW - Linearisation

KW - Data-dependent probabilistic choice

KW - EC Grant Agreement nr.: FP7/214755

KW - EWI-18161

KW - symbolic transformation

KW - Probabilistic automata

KW - FMT-PA: PROCESS ALGEBRAS

KW - FMT-PM: PROBABILISTIC METHODS

KW - CR-F.4

KW - EC Grant Agreement nr.: FP7-ICT-2007-1

U2 - 10.1109/ACSD.2010.18

DO - 10.1109/ACSD.2010.18

M3 - Conference contribution

SN - 978-0-7695-4066-5

SP - 213

EP - 222

BT - Application of Concurrency to System Design, Tenth International Conference on

A2 - Gomes, L.

A2 - Khomenko, V.

A2 - Fernandes, J.M.

PB - IEEE Computer Society Press

CY - Los Alamitos

ER -

Katoen JP, van de Pol JC, Stoelinga MIA, Timmer M. A linear process-algebraic format for probabilistic systems with data. In Gomes L, Khomenko V, Fernandes JM, editors, Application of Concurrency to System Design, Tenth International Conference on. Los Alamitos: IEEE Computer Society Press. 2010. p. 213-222. 10.1109/ACSD.2010.18 https://doi.org/10.1109/ACSD.2010.18