Un modele de description de protocoles : Les reseaux fermes d'automates triphases

  • André Arnold
  • Pascal Guitton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


Nous Proposons FIFO Channel Canal Vide Full Duplex Transmission Duplex Link 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 — Bibliographie

  1. [ARN 81]
    A. ARNOLD. Synchronous nets of automata and concurrent processes. Rapport de recherche LIUP, no 11, octobre 81.Google Scholar
  2. [BAR 69]
    K.A. BARTLETT, R.A. SCANTLEBURRY et P.T. Wilkinson. A note on reliable full duplex transmission over half duplex links. CACM, vol 12–5, may 69, p. 260–265.Google Scholar
  3. [BOC 78]
    G.B. BOCHMANN. Finite state description of communication protocols. Computer networks, vol 2, october 78, p. 361–372.Google Scholar
  4. [GIL 62]
    A. GILL. Introduction to the theory of finite state machines. Mac Graw-Hill, New York, 62.Google Scholar
  5. [GUI 84]
    P. GUITTON. Description, validation et test de conformité de protocoles de communication. Thèse de 3è cycle, Université de Bordeaux I, janvier 84.Google Scholar
  6. [KOH 70]
    Z. KOHAVI. Switching and finite automata theory. Mac Graw-Hill, New York, 70.Google Scholar
  7. [LAM 82]
    S. S. LAM et A. U. SHANKAR. An illustration of protocol projections. Proc. 2nd Int. workshop on protocol specification, testing and verification, may 82.Google Scholar
  8. [MER 76]
    P. M. MERLIN. A methodology for the design and implementation of communication protocols. IEEE trans on communication, vol COM 24–5, june 76, p. 614–621.Google Scholar
  9. [PAC 82]
    J. K. PACHL. Reachability problems for communicating finitestate machines. Dept of computer science, University of Waterloo, research report CS-82-12, may 82.Google Scholar
  10. [RAZ 82]
    R. R. RAZOUK. Modeling X25 using the graph model of behaviour. Protocol specification, testing and verification, North-Holland, p. 297–314, IFIP 82.Google Scholar
  11. [STE 76]
    N.V. STENNING. A data transfer protocol. Computer networks, vol. 1–2, september 76, p. 99–110.Google Scholar
  12. [VUO 83]
    S.T. VUONG et D.D. COWAN. Reachability analysis of protocols with FIFO channels. SIGCOMM'83 Symposium, communications architectures and protocols, university of Texas, 8–9 march 83.Google Scholar
  13. [ZAF 80]
    P. ZAFIROPOULO, H. WEST, H. RUDIN, D.D. COWAN, D. BRAND. Towards analysing and synthesizing protocols. IEEE trans on communication, vol COM 28-4, april 80, p. 651–661.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • André Arnold
    • 1
  • Pascal Guitton
    • 2
  1. 1.Laboratoire d'InformatiqueUniversité de PoitiersPoitiers Cédex
  2. 2.Université de Bordeaux I UER de Math. et d'InformatiqueTalence Cédex

Personalised recommendations