Closed Covers: To Verify Progress for Communicating Finite State Machines

DOI10.1109/TSE.1984.5010313zbMath0547.68060OpenAlexW1987433648MaRDI QIDQ3339299

Mohamed G. Gouda

Publication date: 1984

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

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

zbMATH Keywords

communication protocolscommunication progresscommunicating finite state machinesverification techniquesunbounded FIFO channels

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Two normal form theorems for CSP programs ⋮ A methodology for constructing communication protocols with multiple concurrent functions ⋮ An interface theory for service-oriented design ⋮ Probabilistic verification of communication protocols

This page was built for publication: Closed Covers: To Verify Progress for Communicating Finite State Machines