Advertisement

Protocol validation: A parallel technique to reduce the reachability tree

  • Abderrahim Benslimane
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 817)

Abstract

Protocol validation detects the existence of logic errors in protocol design specifications. The commonly used technique to validate protocols is reachability analysis. However, it has a major drawback which is the combinatorial explosion of the state space. Several methods have been proposed to decrease the number of states. This paper presents a new method of parallel execution of actions, allowing reduction of reachable state space and detection of two types of logic errors: deadlocks and blocking reception states.

Keywords

Communication Protocol Global State Finite State Machine Reachable State Reachability Analysis 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Benslimane, “ An Algebraic Approach to Validate Communication Protocols” Proc. of the Third workshop on the Future Trends of Distributed Computing Systems, Taipei Taiwan, IEEE Computer Society Press, (14–16 April 1992), pp. 34–40.Google Scholar
  2. [2]
    G. V. Bochmann, “ Finite State Description of Communication Protocols” Computer Networks, Nℴ2, (1978), pp. 361–372.Google Scholar
  3. [3]
    D. Brand and P. Zafiropulo, “On Communicating Finite-State Machines” Journal of the Association for Computing Machinery, vol. 30, Nℴ 2, (April 1983), pp. 323–342.Google Scholar
  4. [4]
    A.S. Danthine, “Protocol Representation with Finite State Models”, IEEE Trans. on Commun., Vol. COM-28, Nℴ 4, (April 1980), pp. 632–642.CrossRefGoogle Scholar
  5. [5]
    M.G. Gouda and Y.T. Yu, “Protocol Validation by Maximal Progress State Exploration” IEEE Trans. on Commun., Vol. COM-32, Nℴ 1, (January 1984), pp. 94–97.Google Scholar
  6. [6]
    M.G. Gouda, E.G. Manning, and Y.T. Yu, “On the Progress of Communication between Two Finite State Machines”, Information and Control 63, (1984), pp. 200–216.CrossRefGoogle Scholar
  7. [7]
    G.J. Holzmann, “A Theory for Protocol Validation” IEEE Trans. on Comp., Vol. C-31, Nℴ 8, (August 1982), pp. 730–738.Google Scholar
  8. [8]
    M. Itho and H. Ichikawa, “Protocol Verification Algorithm Using Reduced Reachability Analysis” Trans. of the IECE of Japan, Vol. E-60, Nℴ 2, (February 1983), pp. 88–93.Google Scholar
  9. [9]
    Y. Kakuda, Y. Wakahara and M. Norigoe, “An Acyclic Expansion Algorithm for Fast Protocol Validation” IEEE Trans. on Soft. Eng., Vol 14, Nℴ 8, (August 1988), pp. 1059–1069.CrossRefGoogle Scholar
  10. [10]
    R.M. Karp and R.E. Miller, “Parallel Program Schemata” Journal of Comp. Syst. and Sci., Vol. 3, (1969), pp. 147–195.Google Scholar
  11. [11]
    P.M. Merlin, “A Methodology for the Design and Implementation of Communication Protocols”, IEEE Trans. on Commun., Vol. COM-24, Nℴ 6, (June 1976), pp. 614–621.CrossRefGoogle Scholar
  12. [12]
    P. M. Merlin, “Specification and validation of protocols”, IEEE Trans. Commun., COM-27, 11, pp 1671–1680, Nov. 1979.CrossRefGoogle Scholar
  13. [13]
    J. L. Peterson, “In Petri net theory and the modeling of systems”. Prentice Hall, 1981.Google Scholar
  14. [14]
    J. Rubin and C.H. West, “An Improved Protocol Validation Technique” Computer Networks, 6, (1982), pp. 65–73.CrossRefGoogle Scholar
  15. [15]
    C.A. Sunshine, “Formal Modeling of Communication Protocols” Computer Networks and Simulation II, S. Schoemaker (ed.), North-Holland Publishing Compagny, (1982), pp. 53–75.Google Scholar
  16. [16]
    C.H. West, “General Technique for Communications Protocol Validation” IBM J. Res. Devel., Vol. 22, Nℴ 4, (July 1978), pp. 393–404.Google Scholar
  17. [17]
    P. Zafiropulo, “Protocol Validation by Duologue-Matrix Analysis” IEEE Trans. on Commun., Vol. COM-26, Nℴ 8, (August 1978), pp. 1187–1194.CrossRefGoogle Scholar
  18. [18]
    P. Zafiropulo, C.H. West, H. Rudin, D.D. Cowan and D. Brand, “Towards analyzing and synthesizing protocols”, IEEE transactions on communication, Vol. COM 28, pp 651–661, April 1980.CrossRefGoogle Scholar
  19. [19]
    J. Zhao and G.V. Bochmann, “Reduced Reachability Analysis of Communication Protocols: A new approach” PSTV, VI, B. Sarikaya and G.V. Bochmann (ed.), North-Holland Pub. Compagny IFIP, (1987), pp. 243–254.Google Scholar
  20. [20]
    A. Benslimane “Contribution à la Validation des Protocoles: réduction de l'espace d'états et décidabilité du caractère borné” Thèse de docteur de l'Université de Franche-Comté, (1993).Google Scholar
  21. [21]
    E. Chabbar “Etude et Analyse de la communication des processus” LaBRI, Université de Bordeaux I, Rapport de recherche intern Nℴ I-8918, (1989).Google Scholar
  22. [22]
    L. Cacciari and O. Rafiq “On Improving Reduced Reachability Analysis” FORTE'92, Perros-Guirec France, (13–16 September 1992), pp.1–6.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Abderrahim Benslimane
    • 1
  1. 1.Laboratoire d'InformatiqueUFR des Sciences et TechniqueBesanÇonFrance

Personalised recommendations