Closed Covers: To Verify Progress for Communicating Finite State Machines

DOI10.1109/TSE.1984.5010313zbMATH Open0547.68060OpenAlexW1987433648MaRDI QIDQ3339299FDOQ3339299

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

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

zbMATH Keywords

communication protocolscommunication progresscommunicating finite state machinesverification techniquesunbounded FIFO channels

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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
• Title not available (Why is that?)
• 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)