Synthesis of Communicating Finite-State Machines with Guaranteed Progress

DOI10.1109/TCOM.1984.1096134MaRDI QIDQ3219124zbMATH OpenOpenAlexFDO

Authors Yao-Tin Yu, Mohamed G. Gouda

Publication date 1984

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

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

zbMATH Keywords

communicating finite-state machinescommunication protocolsFIFO channels

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Communication, information (94A99)

Recommendations

• On the progress of communication between two finite state machines
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• scientific article; zbMATH DE number 3881887
• Synthesis of Safe Message-Passing Systems
• On Communicating Finite-State Machines

Cited in

(9)

• Submodule construction as equation solving in CCS
• Connecting open systems of communicating finite state machines
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• On the progress of communication between two finite state machines
• Channel synthesis for finite transducers
• Channel synthesis revisited
• Synthesis of Safe Message-Passing Systems
• Channel synthesis for finite transducers
• A centralized and a decentralized method to automatically derive choreography-conforming web service systems

This page was built for publication: Synthesis of Communicating Finite-State Machines with Guaranteed Progress

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