Skip to main content

Notion de Dualite et de Symetrie dans les Reseaux de Petri

  • Conference paper
  • First Online:

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

Abstract

After having recalled some basic definitions and properties of the Petri nets, we synthesize some algebraic results, based upon a theorem of compatibility of linear inequalities systems (near of the Farkas lemma).

We find, as corollaries of equivalence theorems between algebraic propositions and Petri nets properties, two theorems synthesizing new results and scattered ones in the literature. Moreover, we refind a necessary condition for a Petri net to be live only based upon the structure of the graph, and also a symmetrical necessary condition for a Petri net to be bounded and live.

We recall, then, the leakage notion [10] and define the symmetrical notion of accumulator from where we derive a necessary condition for a Petri net to be bounded and live.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. J. ABADIE "Problèmes d'optimalisation" U.V. Informatique Opérationnelle Institut de Programmation Pub. no 41 (1972–1973).

    Google Scholar 

  2. E. BEST, H. SCHMID "Systems of Open Paths in Petri Nets" Proc. of the Symp. On M.F.C.S. 75 Lect. notes in Comp. Sc. no 32 Springer Verlag 1975.

    Google Scholar 

  3. P. CAMION "Modules unimodulaires" J. of Combinatorial theory 4, 1968, p. 301–362.

    Google Scholar 

  4. F. COMMONER, A. HOLT, S. EVEN, A. PNUELI "Marked Directed Graphs" J. Comput. System Sci. 5 Oct. 1971, p. 511–523.

    Google Scholar 

  5. F. COMMONER "Deadlocks in Petri Nets" CA-7206-2311, Applied Data Research, Wakefield, Mass. June 1972.

    Google Scholar 

  6. M. HACK "Analysis of Production Schemata by Petri Nets" MS. Thesis Dept Electrical Engineering, MACTR 94, Project MAC, M.I.T. Cambridge, Mass. Sept. 1972.

    Google Scholar 

  7. K. LAUTENBACH, H. SCHMID "Use of Petri Nets for Proving Correctness of Concurrent Process System". Information processing 1974. North Holland Publ. Co 1974, p. 187–191.

    Google Scholar 

  8. Y.E. LIEN "Termination Properties of Generalized Petri Nets" S.I.A.M. J. Comput., June 1976, Vol 5, no 2, pages 251–265.

    Google Scholar 

  9. Y.E. LIEN "A Note on Transition Systems" J. Inf. Sciences 1976, Vol 10 No 4, p. 347–362.

    Article  Google Scholar 

  10. G. MEMMI "Fuitesdans les réseaux de Pétri" RAIRO Inf. Théorique, Vol 12 No 12, p. 125–144 (Juin 1978).

    Google Scholar 

  11. G. MEMMI "Application of the semi-flow notion to the Boundeness and Liveness Problems in the Petri Nets Theory" Proc. of the Conf. on Information Sciences and Systems, John Hopkins University, Baltimore, U.S.A., March 1978.

    Google Scholar 

  12. C. RAMCHANDANI "Analysis of Asynchronous Concurrent Systems by Timed Petri Nets" Ph. D. Thesis, Project MAC. MAC-TR-120, Cambridge, Mass. Feb 1974.

    Google Scholar 

  13. J. SIFAKIS "Structural Properties of Petri Nets" Lab. ass. au C.N.R.S. no 7, R.R. no 102, Grenoble Déc 1977.

    Google Scholar 

  14. R. VALK "Prévention des bloquages aux systèmes parallèles"

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gilles Kahn

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

MEMMI, G. (1979). Notion de Dualite et de Symetrie dans les Reseaux de Petri. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022465

Download citation

  • DOI: https://doi.org/10.1007/BFb0022465

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09511-8

  • Online ISBN: 978-3-540-35163-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics