Answers are grounded in this paper and cite their sources.
LetMandNbe two communicating finite state machines which exchange one type of message. We develope a polynomial algorithm to detect whether or notMandNcan reach a deadlock. The time complexity of the algorithm isO(m³n³and its space isO(mn)wheremandnare the numbers of states inMandN, respectively. The algorithm can also be used to verify that two communicating machines which exchange many types of messages are deadlock-free.
No takes yet. Share an insight, caveat, or question.
Yu et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: