arXiv Open Access 2016

Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm

Camille Coti Charles Lakos Laure Petrucci

Lihat Sumber

Abstrak

This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes connected by a tree topology and converts it to a ring configuration. The Coloured Petri net model not only facilitates the proof that the algorithm is correct and self-stabilising but also easily shows that it enjoys new properties of termination and silentness. Further, the formal results show how the algorithm can be simplified without loss of generality.

Topik & Kata Kunci

cs.DC

Penulis (3)

Camille Coti

Charles Lakos

Laure Petrucci

Format Sitasi

APA MLA BibTeX

Coti, C., Lakos, C., Petrucci, L. (2016). Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm. https://arxiv.org/abs/1601.03767

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓