Skip to main content
SpringerLink
Log in

Modeling and analysis of temporal constraints in communication protocols

MODÉLISATION ET ANALYSE DES CONTRAINTES TEMPORELLES DANS LES PROTOCOLES DE COMMUNICATION

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Abstract

Reachability analysis is the most popular and the most used method in protocol validation. It consists in constructing a graph called reachability graph, describing the communication of communicating machines exchanging messages through fifa channels. The states and structure of this graph are then analysed according to given properties to validate the corresponding communication protocol. In this paper, we go from the communicating machines used in the classical reachability analysis, to design temporal communicating machines allowing to specify quantitative temporal aspects of communication protocols. A temporal reachability graph describing the global behaviour of temporal communicating machines is then defined. After that, we show how this graph can be used to analyse general properties of communication protocols submitted to temporal constraints and we establish several complexity results dealing with this approach.

Résumé

La méthode de validation des protocoles qui est la plus populaire et la plus utilisée, est ľanalyse ďaccessibilité. Elle part ďautomates finis spécifiant des machines communicantes échangeant des messages à travers des canaux fifa, pour développer un graphe décrivant ľensemble de la communication, appelé graphe ďaccessibilité. Les états et la structure de ce graphe sont alors examinés à la lumière ďun certain nombre de propriétés pour valider le protocole mis en œuvre. Dans cet article, nous montrons comment on peut partir du modèle ďautomates communicants utilisés dans cette technique pour concevoir un modèle de machines communicantes dites temporelles, permettant de prendre en compte les aspects temporels quantitatifs des protocoles de communication. Un graphe ďaccessibilité temporel est alors développé, pour décrire la communication des machines obtenues. Ensuite, nous montrons comment ce graphe peut être utilisé pour valider des propriétés générales des protocoles soumis à des contraintes temporelles et nous établissons plusieurs résultats de complexité concernant cette approche.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur (R.),Dill (D. L.). Automata for modelling real-time systems.Proc. ICALP’90, LNCS 443, Springer-Verlag (1990), pp. 323–335.

  2. Alur (R.),Courcoubetis (C.),Dill (D. L.). Model-cheking for real-time systems.Proc. 5th IEEE Symp. on Logic in Computer Science (1990), pp. 414–425.

  3. Alur (R),Dill (D. L.). The theory of timed automata.Proc. REX Workshop, LNCS 600, Springer Verlag (1991), pp. 45–73.

  4. Alur (R.),Henzinger (T. A.). Logics and models of real-time: a survey.Proc. REX Workshop, LNCS 600, Springer-Verlag (1991), pp. 74–106.

  5. Alur (R.),Feder (T.),Henzinger (T. A.). The benefits of relaxing punctuality.Proc. 10th Annual ACM. Symp. on Principles of Distributed Computing (1991), pp. 139–152.

  6. Alur (R.),Dill (D. L.),Wong-Toi (H.),Courcoubetis (C.),Halbwachs (N.). Minimizing of timed transition systems.Proc. Concur’92, LNCS 630, Springer-Verlag (1992), pp. 340–354.

  7. Alur (R.), Courcoubetis (C.), Dill (D. L.). Model-cheking in dense real-time.Information and Computation (1993),104, pp. 2–34.

    Article  MATH  MathSciNet  Google Scholar 

  8. Alur (R.), Henzinger (T. A.). Real-time logics: complexity and expressiveness.Information and Computation (1993),104, pp. 35–77.

    Article  MATH  MathSciNet  Google Scholar 

  9. Alur (R.), Dill (D. L.). A theory of timed automata.Theoretical Computer Science (1994),126, pp. 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  10. Aspavall (B.),Shiloach (Y.). A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality.Proc. 20th Ann. Symp. on Foundation of Computer Sciences, IEEE (1979), pp. 205–217.

  11. Bergstra (J. A.),Klop (J. W.). Process algebra for synchronous communication.Information and Control (1984),60.

  12. Berthomieu (B.),Menasche (M.). A state enumeration approach for analyzing time Petri nets.Proc. 3rd European Workshop on Applications and Theory of Petri Nets (1982).

  13. Berthomieu (B.), Diaz (M.). Modeling and verification of time dependent systems using time Petri nets.IEEE Trans. Soft. Eng. (1991),17, pp. 259–273.

    Article  MathSciNet  Google Scholar 

  14. Brand (D.), Zafiropulo (P.). On communicating finite state machines.J. ACM (1983),30, pp. 361–371.

    Article  MathSciNet  Google Scholar 

  15. Büchi (R.). On a decision method in restricted second-order arithmetic.Proc. Int. Cong. on Logic, Methodology and Philosophy of Science (1960).

  16. Cacciari (L.), Rafiq (O.). On improving reduced reachability analysis.Proc. Forte’92, North Holland (1993), pp. 137–152.

    Google Scholar 

  17. Cacciari (L.),Rafiq (O.). Decidability issues in reduced reachability analysis.Proc. IEEE Int. Conf. on Network Protocols (1993), pp. 158–165.

  18. Courtiat (J. P.),Diaz (M.). Time in state-based formal description techniques for distributed systems.Proc. REX Workshop, LNCS 600, Springer Verlag (1991), pp. 149–175.

  19. Courtiat (J. P.), De Camargo (M. S.), Saidouni (D. E.). rt_Lotos: Lotos temporisé pour la spécification de systèmes temps réel.Actes de CFIP’93, Hermès, Paris (1993), pp. 427–441.

    Google Scholar 

  20. Dill (D. L.). Timing assumptions and verification of finite-state concurrent systems.Proc. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag (1989), pp. 197–212.

  21. Floyd (R. W.). Algorithm 97, shortest path.Comm. of ACM 5, p. 345.

  22. Henzinger (T. A.),Manna (Z.),Pnueli (A.). Timed transition systems.Proc. REX Workshop, LNCS 600, Springer Verlag (1991), pp. 226–251.

  23. Henzinger (T. A.),Manna (Z.),Pnueli (A.). Temporal proof methodologies for real-time systems.Proc. 18th Annual ACM Symp. on Programming Languages (1991), pp. 353–366.

  24. Holzmann (G. J.). Automated protocol validation in argos, assertion proving and scatter searching.IEEE Trans. on Soft. Eng. (1987),13, pp. 683–696.

    Article  Google Scholar 

  25. Holzmann (G. J.). On limits and possibilities of automated protocol analysis.Proc. PSTV’87, North-Holland (1987), pp. 339–344.

    Google Scholar 

  26. Kohavi (Z.). Switching and finite automata theory.Mc GrawHill (1978).

  27. Leduc (G.), Leonard (L.). Comment rendre Lotos apte à spécifier des systèmes temps réel.Actes de CFIP’93, Hermès, Paris (1993), pp. 407–426.

    Google Scholar 

  28. Merlin (P.),Faber (D. J.). Recoverability of communication protocols.IEEE Trans. COM (1976),24.

  29. Nicollin (X.),Sifakis (J.). An overview and synthesis on timed process algebras.Proc. CAV’91, LNCS 575, Springer Verlag (1991), pp. 376–398.

  30. Ostroff (J. S.). Automated verification of timed transition models.Proc. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag (1989), pp. 247–256.

  31. Rafiq (O.), Cacciari (L.). La validation réduite des protocoles de communication.Actes de CFIP’93, Hermès, Paris (1993), pp. 133–147.

    Google Scholar 

  32. Rafiq (O.),Cacciari (L.). Protocoles, contraintes temporelles et validation.Actes de CFIP’95.

  33. Ramchandani (C.). Analysis of asynchronous concurrent systems by timed Petri nets.Tech. Rep. 120, Project MAC, MIT (1974).

  34. Reed (G.),Roscoe (A.). A timed model for communicating sequential processes.Proc. ICALP’96, Springer Verlag (1986), pp. 314–323.

  35. Shaw (A. C.). Communicating real-time state machines.IEEE Trans. Soft. Eng. (1992),18, pp. 805–816.

    Article  Google Scholar 

  36. Sunshine (C. A.). Interprocess communication protocols for computer networks.Ph. D. Thesis, Stanford University (1975).

  37. West (C. H.). An automated technique of communications protocol validation.IEEE Trans. COM (1978),26, pp. 1271–1275.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire tasc/Informatique, Université de Pau, avenue de ľUniversité, F-64000, Pau, France

    Leo Cacciari & Omar Rafiq

Authors
  1. Leo Cacciari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omar Rafiq
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported by CNET-France Télécom under Grant 92 1B 178 as part of the cnet-cnrs Cesarne project on the design of high-speed multimedia cooperative systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cacciari, L., Rafiq, O. Modeling and analysis of temporal constraints in communication protocols. Ann. Télécommun. 50, 907–919 (1995). https://doi.org/10.1007/BF03005246

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03005246

Key words

Mots clés

Search

Navigation