Close category search window
 

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.

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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.