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 ORCID-iD

    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
    Fundings :
      Source : OpenAIRE Research Graph
    • Learning, Analysis, SynthesiS and Optimization of Cyber-Physical Systems; Funder: European Commission; Code: 669844

    Linked data

    Source : ScholeXplorer IsCitedBy ARXIV 2005.07509
    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.concur.2020.28
    Source : ScholeXplorer IsCitedBy DOI 10.48550/arxiv.2005.07509
    • 10.4230/lipics.concur.2020.28
    • 10.48550/arxiv.2005.07509
    • 2005.07509
    Monads and Quantitative Equational Theories for Nondeterminism and Probability
    Mio, Matteo ; Vignudelli, Valeria ;

    12 Documents citing this article


    Consultation statistics

    This page has been seen 695 times.
    This article's PDF has been downloaded 491 times.