Verification of a sliding window protocol in \(\mu\) CRL and PVS
From MaRDI portal
Publication:2576590
DOI10.1007/s00165-005-0070-0zbMath1101.68309WikidataQ62047499 ScholiaQ62047499MaRDI QIDQ2576590
Jan Friso Groote, Jun Pang, Jaco van de Pol, W. J. Fokkink, Bahareh Badban
Publication date: 13 December 2005
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-005-0070-0
Process algebra; Specification; Branching bisimulation; Sliding window protocols; Verification techniques
68M10: Network design and communication in computer systems
Related Items
Symbolic Reachability for Process Algebras with Recursive Data Types, Cones and foci: A mechanical framework for protocol verification, Model checking a cache coherence protocol of a Java DSM implementation
Uses Software