Abstract
In distributed systems most difficulties come from parallelism. The multiplicity of sites but also the repetitions due to losses of informations and to recoveries of crashed sites induce a combinatorial proliferation of possible system states. This makes difficult to study the conjonctions of normal actions, failures and recoveries and to obtain more than a superficial confidence of the reliability of algorithms. Thus a methodology oriented toward the modelling of parallelism is needed for the analysis of distributed algorithms and protocols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baer, J.L., Gardarin, G., Girault, C., Roucairol, G. The two step commitment protocol, modeling, specification and proof methodology, internal report.Institut de Programmation, Paris, may 1980 5th international conf. on software engineering, San Diego, march 1981
Berthelot, G., Terrat, R. Modélisation et validation de protocoles de transport par réseaux de Petri, 5 th Summer School Programming 80, Primorsko, Bulgaria,June 1980.
Berthelot, G., Terrat, R. Utilisation de réseaux de Petri à prédicats pour la modélisation et la preuve de protocoles de transmission de type HDLC (To appear).
Bochman, G-V., Jecsei, J. A unified method for the application and verification of protocols. In: Information Processing 77, ed. Gilchrist, B., IFIP, North Holland Publishing Company, 1977
Brauer, W. (ed.) Net Theory and Applications, Proc of the advanced course on general net theory of Processes and systems. Hamburg, October 1979, Lecture Notes in Computer Science, n° 84, Springer Verlag, 1980
Danthime, A. Protocol representation with finite state models. I.E.E.E. Transactions on communications, vol. 28, n°4, april 1980
Genrich, H-J., Lautenbach, K. The analysis of distributed systems by means of predicate transition nets. In: Semantics of concurrent computation, Evian, 1979. Ed. Kahn,G. Springer Verlag, Lecture Notes in Computer Science n° 70, p. 123–146, 1979
Girault, C. Proof of protocols in the case of failures in: advanced course on parallel processing. University of Technology - Lougborough Sept, 1980, to appear in Parallel processing systems (D. Evans ed.) Press of Cambridge University.
Jensen, K. Coloured Petri nets and the invariant method. DAI MI-PB-104, Aarhus University, october 1979, p. 1–27
Keller, R-M. Formal verification of parallel programs. Communications of the A.C.M. vol. 19, n° 7, July 1976, p. 371–384
Merlin, P., Farber, D-J. Recoverability of communication protocols implications of a theorical study. I.E.E.E., Transactions on Com., September 1976, p. 1036–1043
Owicki, S., Gries, D. Verifying properties of parallel programs an axiomatic approach, C.A.C.M., 19, 5, may 1976
Peterson, J. A note on coloured Petri nets. Information processing letters, vol. 11, n° 1, august 1980
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthelot, G., Girault, C., Roucairol, G. (1982). Petri Net Modelling and Reliability of Distributed Algorithms. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive