Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Markovian models for performance and dependability evaluation
Lectures on formal methods and performance analysis
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
The power of epidemics: robust communication for large-scale distributed systems
ACM SIGCOMM Computer Communication Review
ACM Transactions on Computer Systems (TOCS)
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
How to model and analyze gossiping protocols?
ACM SIGMETRICS Performance Evaluation Review
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
Knowledge-Based graph exploration analysis
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
| Hi-index | 0.00 |
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].