Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing

Abstract

Abstract. Stochastic bigraphical reactive systems (SBRS) is a recent formalism for modelling systems that evolve in time and space. However, the underlying spatial model is based on sets of trees and thus cannot represent spatial locations that are shared among several entities in a simple or intuitive way. We adopt an extension of the formalism, SBRS with sharing, in which the topology is modelled by a directed acyclic graph structure. We give an overview of SBRS with sharing, we extend it with rule priorities, and then use it to develop a model of the 802.11 CSMA/CA RTS/CTS protocol with exponential backoff, for an arbitrary network topology with possibly overlapping signals. The model uses sharing to model overlapping connectedness areas, instantaneous prioritised rules for deterministic computations, and stochastic rules with exponential reaction rates to model constant and uniformly distributed timeouts and constant transmission times. Equivalence classes of model states modulo instantaneous reactions yield states in a CTMC that can be analysed using the model checker PRISM. We illustrate the model on a simple example wireless network with three overlapping signals and we present some example quantitative properties.

Formalising Sensor Topologies for Target Counting

“…A second strand of research will involve comparing different estimation schemes and establishing links with other formalisations of the target counting problem such as the approach based on Euler characteristic over simplicial complexes introduced by Baryshnikov and Ghrist [2]. Another formalism we will consider is bigraphs with sharing [14], a computational model with strong emphasis on spatial properties of systems that has been used by one of the authors to formalise topological aspects of wireless networks [3].…”

“…The minimised topology is (a) (b) Figure 1: Example topologies with three (a) and nine (b) targets. In both examples, each sensor counts 3 targets, the maximum overlap degree is 3, and the estimated count computed by SCAN is 3 √ 3 ≈ 5.2, which leads to bound [3,9]. indicated by R , while the corresponding sensors and their readings are sets S and C , respectively.…”

“…1b, it is 9. In both cases, SCAN computes the estimated number of targetst = 3 √ 3 ≈ 5.2 and its bounds [3,9]. Observe that the sensor counts do not allow to distinguish the two cases.…”

BigraphTalk: Verified Design of IoT Applications

“…Bigraphs are a universal computational model, defined by Milner [16], for modeling interacting systems that evolve in time and space, and have been applied to model a wide range of systems, e.g. IoT/Edge systems [17]- [19], MixedReality systems [20], context-aware systems [21], networking [22], [23], and security of Cyber-Physical systems [24], [25]. Relationships between entities, e.g.…”

BigraphER: Rewriting and Analysis Engine for Bigraphs

“…Some examples are: security for cyber-physical systems [18], quantitative analysis of biological processes [11], cloud computing [19], and a framework to control systems of networked mobile robotic systems [14]. BigraphER has been used to specify and analyse a wide range of case studies in many different application domains: wireless network protocols [6], wireless mesh networks [4], run-time policy management for domestic networks [5], and human-computer interaction in mixed-reality systems [2]. Example analysis has ranged from detecting basic "programming" errors (e.g.…”