Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
From MaRDI portal
Publication:3090828
DOI10.1007/978-3-642-23217-6_11zbMath1343.68028OpenAlexW177925675WikidataQ62041637 ScholiaQ62041637MaRDI QIDQ3090828
Massimo Merro, Ruggero Lanotte
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_11
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Related Items (5)
Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ A semantic theory of the Internet of things ⋮ Unnamed Item ⋮ Semantic Analysis of Gossip Protocols for Wireless Sensor Networks ⋮ Compositional weak metrics for group key update
Cites Work
- Probabilistic mobile ambients
- A process algebra for timed systems
- Proving Approximate Implementations for Probabilistic I/O Automata
- Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
- Probabilistic Mobility Models for Mobile and Wireless Networks
- Characterising Testing Preorders for Finite Probabilistic Processes
This page was built for publication: Semantic Analysis of Gossip Protocols for Wireless Sensor Networks