We investigate the compositionality of both weak bisimilarity metric and weak similarity quasi- metric semantics with respect to a variety of standard operators, in the context of probabilistic process algebra. We show how compositionality with respect to nondeterministic and probabilistic choice requires to resort to rooted semantics. As a main application, we demonstrate how our results can be successfully used to conduct compositional reasonings to estimate the performances of group key update protocols in a multicast setting.
@InProceedings{lanotte_et_al:LIPIcs.MFCS.2017.72, author = {Lanotte, Ruggero and Merro, Massimo and Tini, Simone}, title = {{Compositional Weak Metrics for Group Key Update}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {72:1--72:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.72}, URN = {urn:nbn:de:0030-drops-81262}, doi = {10.4230/LIPIcs.MFCS.2017.72}, annote = {Keywords: Behavioural metric, compositional reasoning, group key update} }
Feedback for Dagstuhl Publishing