Abstract
We present here an approach using rewriting systems for analysing and proving properties on Petri nets. This approach is implemented in the system PETRIREVE. By establishing a link between the graphic Petri net design and simulation system PETRIPOTE and the term rewriting system generator REVE, PETRIREVE provides an environment for the design and verification of Petri nets. Representing Petri nets by rewriting systems allows easy and direct proofs of the behaviour correctness of the net to be carried out, without having to build the marking graph or to search for net invariants.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
VIII-References
Beaudouin-Lafon M., "Petripote: a graphic system for Petri-nets design and simulation", Proc 4th European Workshop on Applications and Theory of Petri Nets, Toulouse, France, 1983, pp. 20–30
Berthelot G., "Transformations of Petri net", Proc. 5th European Workshop on Application and Theory of Petri nets, Arhus University, Denmark, 1984.
Berthomieu B., "Algebraic Specification of Communication Protocols". Research Report ISI//RR-81-98.
Berthomieu B., "Techniques algébriques pour la spécification et vérification de protocoles de communication", ler Colloque AFCET de Génie Logiciel, Paris, 1982.
Brams G.W. "Réseau de Petri théorie et pratique", Paris, Masson, 1983.
Forgaard R., Guttag J.V., "REVE: a term rewriting system generator with failure-resistant Knuth-Bendix", Proc. of an NSF Workshop on the rewrite rule laboratory, Sep 1983, J. V. Guttag, D. Kapur and D.R. Musser eds., Report no 84GEN008, Avril 1984, General Electric.
Gerhardt S. et al., "An overview of AFFIRM: a specification and verification system", Proc IFIP, Australia, 1980.
Huet G., Hullot J-M., "Proofs induction in equational theories with constructors", Proc 21 st Symp. on Foundations of Computer Science, Los Angeles, October 1980, pp 96–107.
Huet G., Hullot J-M., "A complete proof of correctness of the KNUTH-BENDIX completion algorithm", Journal of Computer and System Science 23(1):11–21, August 1981.
Huet G., Oppen D.G., "Equations and rewrite Rules A SURVEY", in "Formal Language Theory: Pespectives and open Problems", New-York, ed R. Book, Academic Press, 1980, pp 349–405.
Johnen C., "PETRIREVE: Parallélisme et systèmes de réécritures", D.E.A. Report, L.R.I., Orsay, September 1984.
Julliand J., "Expression des communications entre processus d'un programme parallèle par des types abstraits", Thèse, Besançon, 1981.
Julliand J., Perrin G.R., "Construction de programmes parallèles et spécification des communications par des types abstraits", AFCET group meeting GROPLAN, Auron, France, 1981.
Jouannaud J.P., Lescanne P., Reinig F., "Recursive decomposition ordering", Conf. on Formal Description of Programming Concepts, Garmish, 1982.
Lescanne P., "Computer experiments with the REVE term rewriting system generator", Proc 10th Symp. on Principle of Programming Languages, Association for Computing Machinery, Austin TX, USA, 1983, pp. 99–108.
Lescanne P., "Uniform termination of term rewriting systems: recursive decomposition with status", Proc CAAP, Bordeaux, France, Cambridge University Press, 1984.
Memmi G., Roucairol G., "Linear algebra in the net theory", Proc. of Advanced Course on General Net Theory of Processes and Systems, W. Brauer ed., Springer Verlag L.N.C.S 1984.
Ouerghi M.S., "Sémantique algébrique d'un langage de programmation supportant le concept de processus communicants", Thèse de 3ème cycle, Nancy, 1984.
Reinig F., "Les ordres de décomposition: un outil incrémental pour prouver la terminaison finie de systèmes de réécriture de termes", Thèse de 3ème cycle, France, Nancy, CRIN, 81-R-040, Oct 1981.
Sunshine C.A., Thompson D.H., Erickson R.W., Gerhardt S.L., Schwabe D., "Specification and verification of communication protocols in AFFIRM using state transition models", IEEE Trans. on Software Engineering, vol SE-8, no 5, Sep 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choppy, C., Johnen, C. (1985). Petrireve: Proving Petri net properties with rewriting systems. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-15976-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15976-6
Online ISBN: 978-3-540-39679-6
eBook Packages: Springer Book Archive