Free Access
RAIRO-Oper. Res.
Volume 23, Number 1, 1989
Page(s) 43 - 50
Published online 06 February 2017
  • G. BERTHELOT and G. ROUCAIROL, Reduction of Petri Nets, Lecture Notes in Computer Science, vol. 45, 1976, pp. 202-209. [Zbl: 0368.94035] [Google Scholar]
  • G. W. BRAMS, Réseaux de Petri: théorie et pratique, Masson, 1983. [Zbl: 0501.68027] [Google Scholar]
  • J. B. LASSERRE, Consistency of Linear System of Inequalities, JOTA, vol. 49, N° 1, 1986, pp. 177-179. [MR: 843488] [Zbl: 0571.65049] [Google Scholar]
  • K. LAUTENBACH and H. SCHMID, Use of Petri Nets for Proving Correctness of Concurrent Process Systems, Proc. 1974 I.F.I.P. Congress, North Holland, 1974, pp. 187-191. [MR: 441564] [Zbl: 0299.68006] [Google Scholar]
  • G. MEMMI, Applications of the Semiflow Notion to the Bound Dedness and Liveness Problems in Petri Net Theory, Proc. 1978 Conf. on Information Sciences and Systems, John Hopkins University, 1978, pp. 505-509. [Google Scholar]
  • T. MURATA, State Equations, Controllability and Maximal Matchings of Petri Nets, I.E.E.E. Trans. Automatic Control, AC-22, 3, 1977, pp. 412-416. [MR: 456658] [Zbl: 0354.93010] [Google Scholar]
  • J. L. PETERSON, Petri Net Theory and the Modelling of Systems, Prentice Hall, 1981. [MR: 610984] [Zbl: 0461.68059] [Google Scholar]
  • B. PRADIN, Un outil graphique interactif pour la vérification des systèmes à évolutions parallèles décrits par réseaux de Petri, Docteur-Ingénieur Thesis, Université Paul-Sabatier, Toulouse, 1979. [Google Scholar]
  • M. SIMMONNARD, Programmation linéaire, Dunod 1962. [MR: 138505] [Zbl: 0115.37902] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.