Modelling Probabilistic Wireless Networks - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2012

Modelling Probabilistic Wireless Networks


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.
Fichier principal
Vignette du fichier
978-3-642-30793-5_9_Chapter.pdf (474.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01528729 , version 1 (29-05-2017)





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⟩
49 View
63 Download



Gmail Facebook X LinkedIn More