Calibrating an Embedded Protocol on an Asynchronous System

  • Yukiko Yamauchi
  • Doina Bein
  • Toshimitsu Masuzawa
  • Linda Morales
  • I. Hal Sudborough
Part of the Studies in Computational Intelligence book series (SCI, volume 162)


Embedding is a method to obtain new distributed protocols for other topologies from existing protocols designed for specific topologies. But the fault tolerance of the original protocol is rarely preserved in the protocol embedded in the target topology, called embedded protocol. Specifically, transient faults can affect intermediate processes along the path in the target topology that corresponds to a link in the original topology.

In this paper, we propose to analyze and model the communication of the embedded protocol as unreliable communication along the links of the original protocol. We propose a particular type of unreliable channel called almost reliable channel and we show an implementation of these channels for embedding a protocol into another topology.


asynchronous system channel system embedding fault tolerance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of the 8th IEEE International Symposium on Logic in Computer Science, pp. 160–170 (June 1993)Google Scholar
  2. 2.
    Aggarwal, S., Gopinath, B.: Special issue on tools for computer communication systems. IEEE Transactions on Software Engineering 14(3), 277–279 (1988)CrossRefGoogle Scholar
  3. 3.
    Bochmann, G.V.: Finite state description of communication protocols. Computer Networks 2, 361–371 (1978)Google Scholar
  4. 4.
    Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of ACM 30(2), 323–342 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Finkel, A.: Decidability of the termination problem for completely specified protocols. Distributed Computing 7, 129–135 (1994)CrossRefGoogle Scholar
  6. 6.
    Finkel, A., Rosier, L.: A survey on decidability results for classes of fifo nets. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol. 340, pp. 106–132. Springer, Heidelberg (1988)Google Scholar
  7. 7.
    Finkel, A., Sutre, G.: Decidability of reachability problems for classes of two counters automata. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 346–357. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    Gouda, M.: To verify progress for communicating finite state machines. IEEE Transactions on Software Engineering 10(6), 846–855 (1984)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lynch, N.A.: Distributed algorithms. Morgan Kaufmann Publishers, Inc., San Francisco (1996)zbMATHGoogle Scholar
  10. 10.
    Pachl, J.: Reachability problems for communicating finite state machines. Technical Report CS-82-12, University of Waterloo (1982)Google Scholar
  11. 11.
    Rosier, L., Yen, H.: Boundedness, empty channel detection, and synchronization for communicating finite automata. Theoretical Computer Science 44, 69–105 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Schnoebelen, P.: The verification of probabilistic lossy channel systems. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 445–466. Springer, Heidelberg (2004)Google Scholar
  13. 13.
    Sunshine, C.: Formal techniques for protocol specification and verification. Computer Journal 12(9), 20–27 (1979)CrossRefGoogle Scholar
  14. 14.
    Sunshine, C.: Formal Modeling of Communication Protocols. In: Schoemaker, S. (ed.) Computer Networks and Simulation, vol. II, pp. 141–165. Elsevier, North-Holland Publishing, Amsterdam (1982)Google Scholar
  15. 15.
    Vuong, S.T., Cowan, D.D.: Reachability analysis of protocols with FIFO channels. Computer Communication Review 13(2), 49–57 (1983)Google Scholar
  16. 16.
    Yamauchi, Y., Masuzawa, T., Bein, D.: Ring embedding preserving the fault-containment. In: Proceedings of the 7th International Conference on Applications and Principles of Information Science, pp. 43–46 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yukiko Yamauchi
    • 1
  • Doina Bein
    • 2
  • Toshimitsu Masuzawa
    • 1
  • Linda Morales
    • 2
  • I. Hal Sudborough
    • 2
  1. 1.Graduate School of Information Science and TechnologyOsaka University 
  2. 2.Department of Computer ScienceUniversity of Texas at Dallas 

Personalised recommendations