Deadlock Detection for a Class of Communicating Finite State Machines

DOI10.1109/TCOM.1982.1095450zbMath0497.68027OpenAlexW2126163510MaRDI QIDQ3962470

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

Related Items

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