Abstract
Consider a network of two communicating finite state machines which exchange messages over two one-directional, unbounded channels, and assume that each machine receives the messages from its input channel based on some fixed (partial) priority relation. We address the problem of whether the communication of such a network is deadlock-free and bounded. We show that the problem is undecidable if the two machines exchange two types of messages. The problem is also undecidable if the two machines exchange three types of messages, and one of the channels is known to be bounded. However, if the two machines exchange two (or less) types of messages, and one channel is known to be bounded, then the problem becomes decidable. The problem is also decidable if one machine sends one type of message and the second machine sends two (or less) types of messages; the problem becomes undecidable if the second machine sends three types of messages. The problem is also decidable if the message priority relation is empty. We also address the problem of whether there is a message priority relation such that the priority network behaves like a FIFO network. We show that the problem is undecidable in general, and present some special cases for which the problem becomes decidable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
Bochmann, G., Finite State Description of Communication Protocols, Computer Networks, Vol. 2, 1978, pp.361–371.
Brand, D. and Zafiropulo, P., On Communicating Finite-State Machines, J. ACM, Vol. 30, No. 2, April 1983, pp. 323–342.
Cunha, P. and Maibaum, T., A Synchronization Calculus for Message-Oriented Programming, Proc. 2nd International Conf. on Distributed Computing Systems, April 1981, pp. 433–445.
Gouda, M., Manning, E. and Yu, Y., On the Progress of Communication between Two Finite State Machines, University of Texas, Department of Computer Sciences, Tech. Rep. No. 200, May 1982, revised August 1983.
Gouda, M. and Rosier, L., Priority Networks for Communicating Finite State Machines, Technical Report TR 83-10, Dept. of Computer Sciences, Univ. of Texas at Austin, August 1983. Submitted for publication.
Hack, M., Decidability Questions for Petri Nets, Ph.D. dissertation, Department of Electrical Engineering, MIT, 1975.
Hopcroft, J. and Ullman, J., "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, Reading, Mass., 1979.
Ibarra, O., Reversal-Bounded Multicounter Machines and their Decision Problems, J. ACM, Vol. 25, No. 1, 1978, pp. 116–133.
Ibarra, O. and Rosier, L., On Restricted One-Counter Machines, Math. Systems Theory, Vol. 14, 1981, pp. 241–245.
Karp, R. and Miller, R., Parallel Program Schemata, J. of Computer and System Sciences, Vol. 3, No.2, 1969, pp.147–195.
Kosaraju, S., Decidability of Reachability in Vector Addition Systems, Proc. of the 14th Annual ACM Symp. on the Theory of Computing, 1982, pp. 267–281.
Mayr, E., An Algorithm for the General Petri Net Reachability Problem, Proc. of the 13th Annual ACM Symp. on the Theory of Computing, 1981, pp. 238–246.
Merlin, P. and Bochmann, G., On the Construction of Communication Protocols and Module Specification, Pub. 352, Dept. dinformatique de recherche op' erationnelle, Universit'e de Montreal, January 1980.
Minsky, M., "Computation: Finite and Infinite Machines", Prentice Hall, Englewood Cliffs, NJ, 1967.
Peterson, J., "Petri Net Theory and the Modeling of Systems", Prentice Hall, Englewood Cliffs, NJ, 1981.
Rackoff, C., The Covering and Boundedness Problems for Vector Addition Systems, Theor. Comput. Sci., Vol. 6, 1978, pp. 223–231.
Rosier, L. and Gouda, M., On Deciding Progress for a Class of Communication Protocols, in Proc. of the Eighteenth Annual Conference on Information Sciences and Systems, Princeton Univ., 1984.
Sacerdote, G. and Tenney, R., The Decidability of the Reachability Problem for Vector Addition Systems, Proc. of the 9th Annual ACM Symp. on Theory of Computing, 1977, pp. 61–76.
Savitch, W., Relationships between Nondeterministic and Deterministic Tape Complexities, J. of Computer and System Sciences, Vol. 4, No. 2, 1970, pp. 177–192.
Tannenbaum, A., "Computer Networks", Prentice Hall, Englewood Cliffs, NJ, 1981.
Valiant, L. and Paterson, M., Deterministic One-Counter Automata, J. of Computer and System Sciences, Vol. 10, 1975, pp. 340–350.
Yu, Y. and Gouda, M., Deadlock Detection for a Class of Communicating Finite State Machines, IEEE Trans. on Comm., Vol. COM-30, No. 12, December 1982, pp. 2514–2518.
Yu. Y. and Gouda, M., Unboundedness Detection for a Class of Communicating Finite State Machines, to appear in Information Processing Letters.
Zafiropulo, P., et. al., Towards Analyzing and Synthesizing Protocols, IEEE Trans. on Comm., Vol. COM-28, No. 4, April 1980, pp. 651–661.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gouda, M.G., Rosier, L.E. (1984). Communicating finite state machines with priority channels. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive