Probabilistic verification of communication protocols
From MaRDI portal
DOI10.1007/BF01784022zbMATH Open0703.68023OpenAlexW1546325561MaRDI QIDQ916356FDOQ916356
Authors: Krishan Sabnani, Nicholas F. Maxemchuk 
Publication date: 1989
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01784022
Recommendations
- An algorithmic technique for protocol verification
- Verification of multiprocess probabilistic protocols
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Protocol validation — principles and applications
- Protocol Verification via Projections
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cites Work
- Communicating sequential processes
- Testing and generating infinite sequences by a finite automaton
- Closed Covers: To Verify Progress for Communicating Finite State Machines
- Fast Sequential Decoding Algorithm Using a Stack
- Protocol Verification via Projections
- Verification of multiprocess probabilistic protocols
- Verification of a multidestination selective repeat procedure
- An algorithmic technique for protocol verification
Cited In (7)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Validation of Stochastic Systems
- Protocol validation — principles and applications
- Verifying Communication Protocols Using Live Sequence Chart Specifications
- Verification of multiprocess probabilistic protocols
- Deterministic Models of Communication Faults
- ECFSM-based probabilistic protocol verification
This page was built for publication: Probabilistic verification of communication protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916356)
