Probabilistic verification of communication protocols

DOI10.1007/BF01784022MaRDI QIDQ916356zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

validationprobabilistic analysisprobabilistic verificationprotocols

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

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

Cites work

• An algorithmic technique for protocol verification
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• Communicating sequential processes
• Fast Sequential Decoding Algorithm Using a Stack
• Protocol Verification via Projections
• Testing and generating infinite sequences by a finite automaton
• Verification of a multidestination selective repeat procedure
• Verification of multiprocess probabilistic protocols

Cited in

(7)

• Verification of multiprocess probabilistic protocols
• Protocol validation — principles and applications
• Verifying Communication Protocols Using Live Sequence Chart Specifications
• ECFSM-based probabilistic protocol verification
• Deterministic Models of Communication Faults
• Validation of Stochastic Systems
• Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness

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)