Skip to main content

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

  • Conference paper
  • First Online:
Advances in Petri Nets 1990 (ICATPN 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 483))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. G. W. Brams, Les réseaux de Petri: Théorie et pratique, Masson ed, Paris 1981.

    Google Scholar 

  3. 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. M. Corazza, Techniques mathématiques de la fiabilité prévisionnelle, Cepadues ed, Toulouse 1975.

    Google Scholar 

  5. FLORIN G., NATKIN S. Les réseaux de Petri stochastiques. TSI vol 4,1 (1985) pp 143–160.

    Google Scholar 

  6. 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. 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. JEAN-MARIE A., BACCELLI F. The Centaurs race, INRIA research report, august 88.

    Google Scholar 

  9. JENSEN K. Coloured Petri Nets and the Invariant Method, Theoretical Computer Science 14 (1981)

    Google Scholar 

  10. 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. 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. LELANN G. Distributed Systems. Towards a Formal Approach. IFIP Congress 1977. North Holland (1977) pp 155–160.

    Google Scholar 

  13. RAYNAL M. Algorithmes distribués et protocoles. Eyrolles (1985) 142 p.

    Google Scholar 

  14. ZENIE A. Coloured Stochastic Petri nets, Int Workshop on Timed Petri nets, Torino, Italy, July 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Florin, G., Kaiser, C., Natkin, S. (1991). Petri net models of a distributed election protocol on a unidirectional ring. In: Rozenberg, G. (eds) Advances in Petri Nets 1990. ICATPN 1989. Lecture Notes in Computer Science, vol 483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53863-1_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-53863-1_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53863-9

  • Online ISBN: 978-3-540-46369-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics