Modeling robust asynchronous communication protocols with finite-state machines

DOI10.1109/26.221080MaRDI QIDQ3136588zbMATH OpenOpenAlexFDO

Authors Michael M. Wu, Michael C. Loui

Publication date 1993

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

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

zbMATH Keywords

communicating finite-state machinesdeletion and insertion errorsfault modelsmutation errorsreliable communicationrobust protocolssynchronous protocolsunreliable channelsunreliable shared memory

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• On Communicating Finite-State Machines
• A Simple Protocol Whose Proof Isn't
• scientific article; zbMATH DE number 3881867
• Unreliable channels are easier to verify than perfect channels
• On "A Simple Protocol Whose Proof Isńt": The State Machine Approach

Cited in

(5)

• A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
• scientific article; zbMATH DE number 3881867 (Why is no real title available?)
• On Communicating Finite-State Machines
• On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
• Modeling and Programming Asynchronous Automata Networks: The MOCA Approach

This page was built for publication: Modeling robust asynchronous communication protocols with finite-state machines

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