Abstract
In this paper we explore the practical possibilities of using formal methods to analyze gossiping networks. In particular, we use μCRL and Groove to model the peer sampling service, and analyze it through a series of model transformations to CTMCs and finally MRMs. Our tools compute the expected value of various network quality indicators, such as average path lengths, over all possible system runs. Both transient and steady state analysis are supported. We compare our results with the simulation and emulation results found in [10].
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Is CADP an Applicable Formal Method?;Electronic Proceedings in Theoretical Computer Science;2021-11-16
2. Exploring the effects of environmental conditions and design choices on IoT systems using formal methods;Journal of Computational Science;2020-09
3. Quantitative Verification of Social Media Networks;Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, Applications and Technologies;2017-12-05
4. Graph- versus Vector-Based Analysis of a Consensus Protocol;Electronic Proceedings in Theoretical Computer Science;2014-08-01
5. Modelling and analysis using GROOVE;International Journal on Software Tools for Technology Transfer;2011-03-04