Specification and verification of networks protocols using temporal logic

  • Ana R. Cavalli
  • Luis Fariñas Del Cerro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


This paper presents the use of temporal logic for the specification of a data transfer protocol with sliding windows. A proof method for linear temporal logic, based on the classical resolution principle [Rob] is discussed and its use in the proof of a liveness property of the protocol is presented.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aze]
    AZEMA P. Analysis of protocols by means of Prolog interpreted Petri nets Proceedings of 4th European Workshop on Applications and Theory of Petri nets, Toulouse, September 1983.Google Scholar
  2. [Ber]
    BERTHELOT G. "Transformations et analyse des réseaux de Petri — applications aux Protocoles", Thèse d'Etat, LITP, Paris VII, octobre 1983.Google Scholar
  3. [Boch]
    BOCHMANN G.V. "Logical Verification and implementation of Protocols". Proc. fourth data communications symp. CACM/IEEE, 1975, 7, 15–7.20.Google Scholar
  4. [Ca-Fa]
    CAVALLI A.R., FARIÑAS DEL CERRO L. "A decision method for linear temporal logic", Proc. of the Seventh International Conference on Automata Deduction, Napa, Californie, 14–16 may 1984.Google Scholar
  5. [Ca]
    CAVALLI A.R. "A method of automatic proof for the specification and verification of protocols", Proc. of the ACM SIG COMM'84 SYMPOSIUM, Montreal, Canada, June 7–8 1984.Google Scholar
  6. [Di-Da]
    DIAZ M., GUIDACCI DA SILVEIRA G. "Specification and validation of protocols by temporal logic and nets". Proc. of IFIP 83. Paris PP. 47–52.Google Scholar
  7. [Fa]
    FARIÑAS DEL CERRO L., Deduction automatique et logique modale. Thèse d'Etat, LITP, Paris VII, Juin 81.Google Scholar
  8. [GPSS]
    GABBAY D., PNUELI A., SHEALAH S., STAVI J. Temporal Analysis of Fairness. Seventh ACM Symposium on Principles of Programming Languages. Las Vegas, NV, Jan. 1980.Google Scholar
  9. [Ha]
    HAILPERN B. "Verifying Concurrent Processes Using Temporal Logic", Springer Verlag, Berlin-Heidelberg-New York, 1982.Google Scholar
  10. [LaO]
    LAMPORT L., OWICKI S. "Proving Liveness Properties of concurrents programs", ACM Transactions on Programing Languages and Systems, Vol. 4, No3, July 1982.Google Scholar
  11. [La]
    LAMPORT L. "What good is temporal logic ?", Proc. of Cong. IFIP 83, Paris North Holland, 657–667.Google Scholar
  12. [MP]
    MANNA Z., PNUELI A. "Verification of Concurrent Programs, Part I: The Temporal Framework", Department of Computer Science, Stanford University, June 1981.Google Scholar
  13. [MSSch]
    MELLIAR SMITH M.P., SCHWARTS RKLK "Temporal Logic Specifications of distributed Systems", Communication au Congrès Parallélisme et Systèmes distribués", Versailles, Avril 1981.Google Scholar
  14. [NW]
    MANNA Z., WOLPER P. "Synthesis of communication Processes from Temporal Logic Specifications", Department of Computer Science, Stanford Univers. Sept. 1981.Google Scholar
  15. [MSSchVo]
    SCHWARTZ R., MELLIAR SMITH P.P., VOGT F.H. "An Interval Logic for higher level Temporal Reasoning", Report Computer Science Laboratory, SRI International, June 1983.Google Scholar
  16. [Rob]
    ROBINSON J. A machine oriented logic based on the resolution principle. J. ACM, 12, 1965, pp. 23–41.Google Scholar
  17. [Ste]
    STENNING N.V. "A data Transfer Protocol", Computer Net-works 1, pp 99–110, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ana R. Cavalli
    • 1
    • 2
  • Luis Fariñas Del Cerro
    • 3
  1. 1.LITP, Université Paris VIIParis Cedex 05France
  2. 2.Universidad Central de Venezuela (U.C.V.)CaracasVenezuela
  3. 3.LSI, Université Paul SabatierToulouse CedexFrance

Personalised recommendations