Daniel Gebler ; Kim G. Larsen ; Simone Tini - Compositional bisimulation metric reasoning with Probabilistic Process Calculi

lmcs:2627 - Logical Methods in Computer Science, April 27, 2017, Volume 12, Issue 4 - https://doi.org/10.2168/LMCS-12(4:12)2016
Compositional bisimulation metric reasoning with Probabilistic Process Calculi

Authors: Daniel Gebler ; Kim G. Larsen ; Simone Tini

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.


Volume: Volume 12, Issue 4
Published on: April 27, 2017
Accepted on: January 2, 2017
Submitted on: December 15, 2015
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 519 times.
This article's PDF has been downloaded 404 times.