Modelling MAC-Layer Communications in Wireless Systems

Cerone, Andrea; Hennessy, Matthew; Merro, Massimo

doi:10.1007/978-3-642-38493-6_2

Cited by 10 publications

(11 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…|====⇒ Θ ′′ for some Θ ′′ such that ∆ ′′ (✁ s ) e Θ ′′ . Finally, since ∆ ′′ τ |== ⇒ ∆, by the previous case 5 we obtain that Θ ′′ τ |== ⇒ Θ for some Θ such that ∆ (✁ s ) e Θ. Therefore we have shown that…”

Section: Technical Developmentsupporting

confidence: 60%

“…A variant of this calculus which considers only networks with flat topology is presented in [5]. Here the authors develop a notion of reduction barbed congruence for their calculus; they also introduce an extensional semantics whose induced weak bisimulation principle is proved to be sound and complete with respect to the barbed congruence.…”

Section: Case Study: Probabilistic Routingmentioning

confidence: 99%

“…First, it is necessary to define how two wireless networks can be composed together. This topic has already been addressed, for different process calculi, in [23,11,5,2,33]. Here we define an asymmetric operator > which can be used to extend one network with another.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modelling Probabilistic Wireless Networks

Cerone¹,

Hennessy²

2013

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour.We first focus on the problem of composing wireless networks, then we present a compositional theory based on a probabilistic generalisation of the well known may-testing and must-testing preorders. Also, we define an extensional semantics for our calculus, which will be used to define both simulation and deadlock simulation preorders for wireless networks. We prove that our simulation preorder is sound with respect to the may-testing preorder; similarly, the deadlock simulation preorder is sound with respect to the musttesting preorder, for a large class of networks. We also provide a counterexample showing that completeness of the simulation preorder, with respect to the may testing one, does not hold. We conclude the paper with an application of our theory to probabilistic routing protocols.

show abstract

Section: Technical Developmentsupporting

confidence: 60%

Section: Case Study: Probabilistic Routingmentioning

confidence: 99%

See 1 more Smart Citation

Modelling Probabilistic Wireless Networks

Cerone¹,

Hennessy²

2013

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our calculus takes inspiration from algebraic models for wireless systems [21,29,23,14,13,24,25,19,22,35,12,8,5]. All these models adopt broadcast communication on partial topologies, while we consider point-to-point communication, as in [20].…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

“…Prop. 5 was inspired by [8]. A fully abstract observational theory for untimed ad hoc networks can be found in [23,14].…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

A Semantic Theory of the Internet of Things

Castiglioni¹,

Lanotte²,

Merro³

2015

Preprint

Self Cite

View full text Add to dashboard Cite

We propose a process calculus for modelling systems in the Internet of Things paradigm. Our systems interact both with the physical environment, via sensors and actuators, and with smart devices, via short-range and Internet channels. The calculus is equipped with a standard notion of bisimilarity which is a fully abstract characterisation of a well-known contextual equivalence. We use our semantic proof-methods to prove run-time properties as well as system equalities of non-trivial IoT systems. * The contribution of this author is limited to an early writing of some of the proofs in the Appendix.

show abstract

Observation-Oriented Semantics for Calculus of Wireless Systems

Zhu

2015

Unifying Theories of Programming

View full text Add to dashboard Cite

Modelling MAC-Layer Communications in Wireless Systems

Cited by 10 publications

References 24 publications

Modelling Probabilistic Wireless Networks

Modelling Probabilistic Wireless Networks

A Semantic Theory of the Internet of Things

Observation-Oriented Semantics for Calculus of Wireless Systems

Contact Info

Product

Resources

About