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

DOI10.1007/S00165-012-0270-3zbMATH Open1342.68205OpenAlexW2049318064WikidataQ29544202 ScholiaQ29544202MaRDI QIDQ736791FDOQ736791

Authors: M. 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

Recommendations

• Bigraphs with sharing
• A tale of two graph models: a case study in wireless sensor networks
• Stochastic bigraphs
• Probabilistic Bigraphs
• scientific article; zbMATH DE number 2090709

zbMATH Keywords

reactive systemsquantitative analysisformal verification802.11 protocolstochastic bigraphs

Mathematics Subject Classification ID

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

Cites Work

• The Birth of Model Checking
• The Space and Motion of Communicating Agents
• Stochastic bigraphs
• Model-checking continuous-time Markov chains
• Term-rewriting systems with rule priorities
• Bigraphs with sharing
• Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC
• Title not available (Why is that?)
• Automata, Languages and Programming

Cited In (3)

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

Uses Software

• PRISM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736791)