A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Computer Networks
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An operational semantics for a calculus for wireless systems
Theoretical Computer Science
Semantic analysis of gossip protocols for wireless sensor networks
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
IEEE Communications Surveys & Tutorials
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
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.