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

DOI10.1007/s00165-012-0270-3zbMath1342.68205OpenAlexW2049318064WikidataQ29544202 ScholiaQ29544202MaRDI QIDQ736791

Muffy Calder, Michele Sevegnani

Publication date: 5 August 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0270-3

zbMATH Keywords

formal verificationreactive systemsquantitative analysis802.11 protocolstochastic bigraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Conditional Bigraphs ⋮ A tale of two graph models: a case study in wireless sensor networks ⋮ Bigraphs with sharing

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Term-rewriting systems with rule priorities
• Bigraphs with sharing
• The Birth of Model Checking
• The Space and Motion of Communicating Agents
• Stochastic Bigraphs
• Automata, Languages and Programming
• Model-checking continuous-time Markov chains

This page was built for publication: Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing