2012
DOI: 10.1007/978-3-642-30829-1_14
|View full text |Cite
|
Sign up to set email alerts
|

Node Coordination in Peer-to-Peer Networks

Abstract: Abstract. Peer-to-peer networks and other many-to-many relations have become popular especially for content transfer. To better understand and trust these types of networks, we need formally derived and verified models for them. Due to the large scale and heterogeneity of these networks, it may be difficult and cumbersome to create and analyse complete models. In this paper, we employ the modularisation approach of the Event-B formalism to model the separation of the functionality of each peer in a peer-to-pee… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
3
1
1
1

Relationship

4
2

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 18 publications
(20 reference statements)
0
3
0
Order By: Relevance
“…Correctness properties were automatically proved for these systems so that they were kept valid during the stepwise development. Interestingly, for macro-level networks (wireless and peer-to-peer networks), when continuing the stepwise development with distributing the specification, rules valid for Action System development were rediscovered [PeSaSe12,KLPS13] for Event-B, thus validating Kaisa Sere's earlier research [BaSe96a,WaSe98] in the context of automatic theorem provers.…”
mentioning
confidence: 87%
“…Correctness properties were automatically proved for these systems so that they were kept valid during the stepwise development. Interestingly, for macro-level networks (wireless and peer-to-peer networks), when continuing the stepwise development with distributing the specification, rules valid for Action System development were rediscovered [PeSaSe12,KLPS13] for Event-B, thus validating Kaisa Sere's earlier research [BaSe96a,WaSe98] in the context of automatic theorem provers.…”
mentioning
confidence: 87%
“…In data refinement 2 , some variables in the abstract machine are replaced by other variables in the refined machine; in this case, a gluing invariant is added in the refined machine to define the relation between the abstract variables and the newly introduced, concrete ones. Refinement in Event-B has been used to model numerous protocols and systems, including smart cash card systems 31 , vehicle platoons 32 , topology discovery in graphs 33 , self-recovery in sensor-actor networks 34 , spacecraft systems 35 , coordination in peer-to-peer networks 36 , smart grid recoverability 37 , proactive routing in wireless networks 38 , reaction networks 14 , etc.…”
Section: Event-bmentioning
confidence: 99%
“…In data refinement [13], some variables in the more abstract machine are replaced by other variables in the refined machine; in this case, we need to add a gluing invariant in the refined machine, which formally defines the relation between the previous, abstract variables and the newly introduced, concrete ones. Refinement in Event-B has been used to model numerous protocols and systems, see [2,7,23,12,18,28,26,15,19,29]. Event-B benefits from the tool support of the Eclipse-based Rodin platform [3].…”
Section: Event-bmentioning
confidence: 99%