Closed Covers: To Verify Progress for Communicating Finite State Machines

DOI10.1109/TSE.1984.5010313MaRDI QIDQ3339299zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• A testing procedure for deterministic cover finite state machines
• Verification, Model Checking, and Abstract Interpretation
• Verification of well-formed communicating recursive state machines
• Verification of finite-state machines: a distributed approach
• Efficient implementation of coverability verification on communication-free Petri net
• On Communicating Finite-State Machines
• scientific article; zbMATH DE number 4039302
• On the progress of communication between two finite state machines

Cited in

(9)

• A methodology for constructing communication protocols with multiple concurrent functions
• Probabilistic verification of communication protocols
• Two normal form theorems for CSP programs
• An interface theory for service-oriented design
• Connecting open systems of communicating finite state machines
• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• Proving liveness for networks of communicating finite state machines
• scientific article; zbMATH DE number 3976314 (Why is no real title available?)
• On the progress of communication between two finite state machines

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

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