Stochastic Modelling of Communication Protocols from Source Code
From MaRDI portal
Publication:2870288
DOI10.1016/j.entcs.2007.08.013zbMath1279.68024WikidataQ110511831 ScholiaQ110511831MaRDI QIDQ2870288
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
68N15: Theory of programming languages
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M12: Network protocols
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Uses Software
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