Stochastic Modelling of Communication Protocols from Source Code

DOI10.1016/j.entcs.2007.08.013zbMath1279.68024OpenAlexW2088701763WikidataQ110511831 ScholiaQ110511831MaRDI QIDQ2870288

Michael J. A. Smith

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.08.013

zbMATH Keywords

static analysiscommunication protocolsstochastic process algebraperformance modelling

Mathematics Subject Classification ID

Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions

Uses Software

• BLAST
• SLAM
• CCured
• ns-2
• CIL

Cites Work

• Formal techniques for performance analysis: blending SAN and PEPA
• Algorithms for an irreducible and lumpable strong stochastic bound
• Principal component analysis.
• Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
• Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains
• CCured
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item