On "A Simple Protocol Whose Proof Isńt": The State Machine Approach

DOI10.1109/TCOM.1985.1096296MaRDI QIDQ3688295zbMATH OpenOpenAlexFDO

Authors Mohamed G. Gouda

Publication date 1985

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1985.1096296

zbMATH Keywords

communicating finite state machineslivenessreachability graphsafetysequential programsynchronous protocol

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Communication theory (94A05)

Recommendations

• On Communicating Finite-State Machines
• A Simple Protocol Whose Proof Isn't
• Proving liveness for networks of communicating finite state machines
• scientific article; zbMATH DE number 2080915
• Modeling robust asynchronous communication protocols with finite-state machines

Cited in

(6)

• State machines and assertions: An integrated approach to modeling and verification of distributed systems
• Self-stabilization over unreliable communication media
• Modeling robust asynchronous communication protocols with finite-state machines
• On Communicating Finite-State Machines
• A Simple Protocol Whose Proof Isn't
• Mechanically verifying the fundamental liveness property of the Chord protocol

This page was built for publication: On "A Simple Protocol Whose Proof Isńt": The State Machine Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688295)