Deadlock Detection for a Class of Communicating Finite State Machines

DOI10.1109/TCOM.1982.1095450MaRDI QIDQ3962470zbMATH OpenOpenAlexFDO

Authors Yao-Tin Yu, Mohamed G. Gouda

Publication date 1982

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

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

zbMATH Keywords

polynomial algorithmtime complexity

Mathematics Subject Classification ID

Cited in

(4)

• Unboundedness detection for a class of communicating finite-state machines
• Analysis of a class of communicating finite state machines
• An improved protocol validation technique for a class of communication models
• Reasoning about knowledge and messages in asynchronous multi-agent systems

This page was built for publication: Deadlock Detection for a Class of Communicating Finite State Machines

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