Modelling Probabilistic Wireless Networks

Abstract : We propose a process calculus to model distributed wireless networks. The calculus focuses on high-level behaviour, emphasising local broadcast communication and probabilistic behaviour.Our formulation of such systems emphasises their interfaces, through which their behaviour can be observed and tested, although this complicates their contextual analysis. Nevertheless we propose a novel operator with which networks can be decomposed into components. Using this operator we define probabilistic generalisations of the well-known may-testing and must-testing preorders.We define an extensional probabilistic labelled transition system in which actions represent particular interactions networks support via their interfaces. We show that novel variations on probabilistic simulations support compositional reasoning for these networks which are sound with respect to the testing preorders. Finally, and rather surprisingly, we show that these simulations turn out not to be complete.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01528729
Contributor : Hal Ifip <>
Submitted on : Monday, May 29, 2017 - 3:53:54 PM
Last modification on : Monday, May 29, 2017 - 3:55:37 PM
Long-term archiving on : Wednesday, September 6, 2017 - 11:20:50 AM

File

978-3-642-30793-5_9_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Andrea Cerone, Matthew Hennessy. Modelling Probabilistic Wireless Networks. 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.135-151, ⟨10.1007/978-3-642-30793-5_9⟩. ⟨hal-01528729⟩

Share

Metrics

Record views

64

Files downloads

97