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.
Article PDF
Similar content being viewed by others
References
Alshanyour A, Agarwal A (2010) Performance of IEEE 802.11 RTS/CTS with finite buffer and load in imperfect channels: modeling and analysis. In: GLOBECOM, pp 1–6
Aziz A, Sanwal K, Singhal V, Brayton R (1996) Verifying continuous time Markov chains. In: Alur R, Henzinger T (eds) Computer aided verification. Lecture notes in computer science, vol 1102. Springer, Berlin-Heidelberg, pp 269–276
Baeten JCM, Bergstra JA, Klop JW, Weijland WP (1989) Term-rewriting systems with rule priorities. Theor Comput Sci 67: 283–301
Bianchi G (2000) Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J Selected Areas Commun 18(3): 535–547
Chhaya HS, Gupta S (1997) Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol. Wireless Networks 3(3): 217–234
Clarke E (2008) The birth of model checking. In: Grumberg O, Veith H (eds) 25 Years of model checking. Lecture notes in computer science, vol 5000. Springer, Berlin-Heidelberg, pp 1–26
Conforti G, Macedonio D, Sassone V (2005) Spatial logics for bigraphs. In: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds) Proceedings of the 32th international colloquium on automata, languages and programming (ICALP’05). Lecture notes in computer science, vol 3580. Springer, Berlin, pp 766–778
Calder M, Sevegnani M (2012) Matching and rewriting for bigraphs with sharing. Submitted for publication
Duflot M, Fribourg L, Herault T, Lassaigne R, Magniette F, Messika S, Peyronnet S, Picaronny C (2005) Probabilistic model checking of the CSMA/CD protocol using prism and APMC. Electron Notes Theor Comput Sci 128(6): 195–214
IEEE. (2005) Std. 802.11e-2005, Part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications, Amendment 8: medium access control (MAC) quality of service enhancements
Krivine J, Milner R, Troina A (2008) Stochastic bigraphs. Electron Notes Theor Comput Sci 218: 73–96
Kwiatkowska M, Norman G, Parker D (2011) PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan G, Qadeer S (eds) Proceedings of 23rd international conference on computer aided verification (CAV’11). Lecture notes in computer science, vol 6806. Springer, Berlin, pp 585–591
Kwiatkowska M, Norman G, Sproston J (2002) Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In: Hermanns H, Segala R (eds) Proceedings of 2nd joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM/PROBMIV’02). Lecture notes in computer science, vol 2399. Springer, Berlin, pp 169–187
Milner R (2009) The Space and motion of communicating agents. Cambridge University Press, Cambridge
Sevegnani M, Calder M (2010) Bigraphs with sharing. Technical report TR-2010-310, University of Glasgow
Author information
Authors and Affiliations
Corresponding author
Additional information
by Joachim Parrow
This work was funded by EPSRC, as part of Homework project EP/F064225/1.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Calder, M., Sevegnani, M. Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing. Form Asp Comp 26, 537–561 (2014). https://doi.org/10.1007/s00165-012-0270-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-012-0270-3