A process algebra for timed systems
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Testing and Refinement for Nondeterministic and Probabilistic Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Analysis of a gossip protocol in PRISM
ACM SIGMETRICS Performance Evaluation Review
Theoretical Computer Science
Mean-Field Analysis for the Evaluation of Gossip Protocols
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Formal verification and simulation for performance analysis for probabilistic broadcast protocols
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Modelling probabilistic wireless networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Internet of things: a process calculus approach
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols in the context of wireless sensor networks. We introduce a simple probabilistic timed process calculus for modelling wireless sensor networks. A simulation theory is developed to compare probabilistic protocols that have similar behaviour up to a certain probability. This theory is used to prove a number of algebraic laws which revealed to be very effective to evaluate the performances of gossip networks with and without communication collisions.