{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:53:09Z","timestamp":1764841989551,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["669844"],"award-info":[{"award-number":["669844"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study which standard operators of probabilistic process calculi allow for\ncompositional reasoning with respect to bisimulation metric semantics. We argue\nthat uniform continuity (generalizing the earlier proposed property of\nnon-expansiveness) captures the essential nature of compositional reasoning and\nallows now also to reason compositionally about recursive processes. We\ncharacterize the distance between probabilistic processes composed by standard\nprocess algebra operators. Combining these results, we demonstrate how\ncompositional reasoning about systems specified by continuous process algebra\noperators allows for metric assume-guarantee like performance validation.<\/jats:p>","DOI":"10.2168\/lmcs-12(4:12)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:07:20Z","timestamp":1502359640000},"source":"Crossref","is-referenced-by-count":9,"title":["Compositional bisimulation metric reasoning with Probabilistic Process Calculi"],"prefix":"10.46298","volume":"Volume 12, Issue 4","author":[{"given":"Daniel","family":"Gebler","sequence":"first","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3991-5123","authenticated-orcid":false,"given":"Simone","family":"Tini","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1229:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2627\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2627\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:12:28Z","timestamp":1681243948000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(4:12)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1610.06162","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1610.06162","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2627"}}