On the progress of communication between two machines

  • M. G. Gouda
  • E. G. Manning
  • Y. T. Yu
Part VI, Network Operating Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 143)


We consider the following problem concerning any two finite state machines M and N which exchange messages via two one-directional channels. "Is there a positive integer K such that M and N with K-capacity channels never reach a nonprogress state?" The problem is shown to be undecidable in general. For a reasonable class of communicating machines, the problem is shown to be decidable; and the decidability algorithm is polynomial. We also discuss some sufficient conditions for the problem to have a a positive answer; these sufficient conditions can be checked for the given M and N in polynomial time.


Bounded communication communicating finite state machine communication deadlock communication protocol progress unspecified reception 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. V. Bochmann, "Finite state description of communication protocols," Computer Networks, Vol. 2, 1978, pp. 361–371.Google Scholar
  2. [2]
    D. Brand and P. Zafiropulo, "On communication finite-state machines," IBM Research Report, RZ1053(#37725), Jan. 1981.Google Scholar
  3. [3]
    P. R. Cunha and T. S. Maibaum, "A synchronization calculus for message oriented programming," Res. Rep. CS-80-43, Dept. of Comp. Sc., Univ. of Waterloo, Sep. 1980.Google Scholar
  4. [4]
    A. Danthine, "Protocol representation with finite state models," IEEE Trans. Comm., Vol. COM-28, No. 4, April 1980, pp. 632–643.Google Scholar
  5. [5]
    M. R. Garey and D. S. Johnson, Computers and interactability, a guide to the theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979.Google Scholar
  6. [6]
    M. G. Gouda and Y. T. Yu, "Designing deadlock-free and bounded communication protocols," Tech. Rep. 179, Dept. of Comp. Sc., Univ. of Texas at Austin, June 1981. submitted to IEEE Trans. on Comm..Google Scholar
  7. [7]
    Z. Manna, Mathematical theory of computation, McGraw-Hill Book company, 1974.Google Scholar
  8. [8]
    C. A. Sunshine, "Formal modeling of communication protocols," USC/Inform. Sc. Institute, Res. Rep. 81–89, March 1981.Google Scholar
  9. [9]
    C. H. West, "An automated technique of communication protocol validation," IEEE Trans. Comm., Vol. COM-26, pp. 1271–1275, Aug. 1978.Google Scholar
  10. [10]
    Y. T. Yu and M. G. Gouda, "Deadlock-detection for a class of communicating finite state machines," Tech. Rep. 193, Dept. of Computer Sciences, Univ. of Texas at Austin, Feb. 1982. Submitted to IEEE Trans. on Comm..Google Scholar
  11. [11]
    P. Zafiropulo, et al., "Towards analyzing and synthesizing protocols," IEEE Trans. Comm., Vol. COM-28, No. 4, April 1980, pp. 651–661.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • M. G. Gouda
    • 1
  • E. G. Manning
    • 2
  • Y. T. Yu
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinUSA
  2. 2.Department of Computer SciencesUniversity of WaterlooCanada

Personalised recommendations