By Topic

Deadlock Detection for a Class of Communicating Finite State Machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yao-Tin Yu ; Univ. of Texas at Austin, Austin, TX, USA ; Gouda, M.G.

Let M and N be two communicating finite state machines which exchange one type of message. We develope a polynomial algorithm to detect whether or not M and N can reach a deadlock. The time complexity of the algorithm is O(m^{3}n^{3} and its space is O(mn) where m and n are the numbers of states in M and N , 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 )