Abstract
We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of such wireless networks. Further, we construct an extensional LTS (labelled transition system) which models the activities of stations that can be directly observed by the external environment. Standard bisimulations in this LTS provide a sound proof method for proving systems contextually equivalence. We illustrate the usefulness of the proof methodology by a series of examples. Finally we show that this proof method is also complete, for a large class of systems.
Highlights
Wireless networks are becoming increasingly pervasive with applications across many domains, [42, 1]
We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; the broadcasts are subject to collisions
Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of such wireless networks
Summary
Wireless networks are becoming increasingly pervasive with applications across many domains, [42, 1]. They are becoming increasingly complex, with their behaviour depending on ever more sophisticated protocols. 2012 ACM CCS: [Theory of computation]: Models of computation—Concurrency—Process Calculi. Key words and phrases: wireless systems, broadcast communication, collisions, timed process calculi, barbed congruence, extensional semantics.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
