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^{3}n^{3}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.
Published in:
Communications, IEEE Transactions on
(Volume:30
,
Issue:
12
)
Date of Publication:
Dec 1982
- Page(s):
-
2514
-
2518
- ISSN :
-
0090-6778
- Digital Object Identifier :
-
10.1109/TCOM.1982.1095450
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Dec 1982
- Sponsored by :
-
IEEE Communications Society