Petri net models of a distributed election protocol on a unidirectional ring

  • Gérard Florin
  • Claude Kaiser
  • Stéphane Natkin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)


This paper is devoted to the performance analysis of an election protocol for a unidirectional ring proposed by C.Kaiser. We give two models of increasing complexity in order to compute several performance criteria. The two models (called initiation model and evaluation model) are defined using coloured Petri nets. For these models several qualitative properties are proven. Then the required performance criteria are computed using an original computation method defined for non repetitive stochastic Petri net.


distributed algorithms election protocols formal proof performance evaluation stochastic Petri nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BAR 88]
    K.Barkaoui, G.Florin, C.Fraize, B.Lemaire, S.Natkin Reliability Analysis of Non Repairable Systems using Stochastic Petri Nets, proc FTCS 18, Tokyo, july 88.Google Scholar
  2. [BRA 81]
    G. W. Brams, Les réseaux de Petri: Théorie et pratique, Masson ed, Paris 1981.Google Scholar
  3. [CHA 79]
    CHANG E.J., ROBERTS R. An Improved Algorithm for Decentralized Extrema — Finding in Circular Configurations of Processors. Comm.ACM vol 22, 5 (May 1979) pp 281–283.Google Scholar
  4. [COR 75]
    M. Corazza, Techniques mathématiques de la fiabilité prévisionnelle, Cepadues ed, Toulouse 1975.Google Scholar
  5. [FLO 85]
    FLORIN G., NATKIN S. Les réseaux de Petri stochastiques. TSI vol 4,1 (1985) pp 143–160.Google Scholar
  6. [FLO 86]
    G. Florin, S. Natkin, "RDPS: a software package for the evaluation and the validation of dependable computer systems", SAFECOMP86, Sarlat, France, 1986.Google Scholar
  7. [FRA 88]
    FRAIZE C. Les réseaux de Petri stochastiques a graphe de marquages sans circuits: Theorie et application a l'analyse de la fiabilite et des performances des systemes informatiques Ingeneer dissertation, CNAM, Paris, October 1988.Google Scholar
  8. [JEA 88]
    JEAN-MARIE A., BACCELLI F. The Centaurs race, INRIA research report, august 88.Google Scholar
  9. [JEN 81]
    JENSEN K. Coloured Petri Nets and the Invariant Method, Theoretical Computer Science 14 (1981)Google Scholar
  10. [GAR 81]
    GARCIA MOLINA H. Elections in a Distributed Computing system. IEEE Trans on Soft. Eng. Vol 31,1 (Jan 1981) p 48–59.Google Scholar
  11. [KAI 89]
    KAISER C. Election sur un anneau par parcours de reconnaissance;TSI vol 8 No 3, 1989 (Also available as CEDRIC research report).Google Scholar
  12. [LEL 77]
    LELANN G. Distributed Systems. Towards a Formal Approach. IFIP Congress 1977. North Holland (1977) pp 155–160.Google Scholar
  13. [RAY 85]
    RAYNAL M. Algorithmes distribués et protocoles. Eyrolles (1985) 142 p.Google Scholar
  14. [ZEN 85]
    ZENIE A. Coloured Stochastic Petri nets, Int Workshop on Timed Petri nets, Torino, Italy, July 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Gérard Florin
    • 1
  • Claude Kaiser
    • 1
  • Stéphane Natkin
    • 1
  1. 1.Cedric (Centre d'Etudes et de Recherche en Informatique du CNAM) Conservatoire National des Arts et MetiersParis cedex 03France

Personalised recommendations