@inproceedings{a73066809c01479c993a8b2ae602bb5f,
title = "Compositional metric reasoning with probabilistic process calculi",
abstract = "We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the distance between probabilistic processes composed by standard process algebra operators. Combining these results, we demonstrate how compositional reasoning about systems specified by continuous process algebra operators allows for metric assume-guarantee like performance validation.",
author = "Daniel Gebler and Larsen, {Kim Guldstrand} and Simone Tini",
year = "2015",
doi = "10.1007/978-3-662-46678-0_15",
language = "English",
isbn = "978-3-662-46677-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "230--245",
editor = "Andrew Pitts",
booktitle = "Foundations of Software Science and Computation Structures",
address = "Germany",
note = "18th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2015 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 ; Conference date: 11-04-2015 Through 18-04-2015",
}