Abstract
We consider the deadlock detection problem (DDP) of networks of communicating finite state machines (NCFSMs). The DDP problem is known to be undecidable for NCFSMs. In this paper, we provide a characterization of those subclasses of networks for which the deadlock problem is decidable. We also provide a proof technique based on our characterization and illustrate our technique on an example.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Bochmann. Finite State Description of Communication Protocols. Computer Networks, Vol.2, 1978, pp.361–371.
D. Brand and P. Zafiropulo. On Communicating Finite-state Machines. JACM, 30(2), 1983, pp.323–342.
M. Gouda, E. Manning, and Y. T. Yu. On the Progress of Communication between Two Finite State Machines. Information and Control, 63(3), 1984, pp.308–320.
M. Gouda, E. M. Gurari, Ten-Hwang Lai, and L. E. Rosier. On Deadlock Detection in Systems of Communicating Finite State Machines. Computers and Artificial Intelligence, Vol.6, 1987, No.3, pp.209–228.
K. Okumura. Protocol Analysis from Language Structure. In Protocol Specification, testing, and verification VIII,S.Aggarwal and K.Sabnani (Editors), North-Holland, 1988, pp.113–124.
Jan Pachl. Protocol Description and Analysis Based on a State Transition Model with Channel Expressions, In Protocol Specification, testing, and verification VII, H. Rubin and C. H. West (Editors), North-Holland, 1987, pp.207–219.
W. Peng and S. Purushothaman. Analysis of Communicating Processes for Non-Progress. In Proc of the 9th IEEE International Conference on Distributed Computing Systems, June 1989, pp.280–287.
Y. T. Yu and M. Gouda. Deadlock Detection for a Class of Communicating Finite State Machines. IEEE Transactions on Communications, Dec 1982, pp.2514–2518.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, W., Purushothaman, S. (1991). A unified approach to the deadlock detection problem in networks of communicating finite state machines. In: Clarke, E.M., Kurshan, R.P. (eds) Computer-Aided Verification. CAV 1990. Lecture Notes in Computer Science, vol 531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023738
Download citation
DOI: https://doi.org/10.1007/BFb0023738
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54477-7
Online ISBN: 978-3-540-38394-9
eBook Packages: Springer Book Archive