Notion de Dualite et de Symetrie dans les Reseaux de Petri

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationSemantics of Concurrent Computation - Proceedings of the International Symposium
EditorsGilles Kahn
PublisherSpringer Verlag
Pages91-108
Number of pages18
ISBN (Print)9783540095118
DOIs
Publication statusPublished - 1 Jan 1979
EventInternational Symposium on Semantics of Concurrent Computation, 1979 - Evian, France
Duration: 2 Jul 19794 Jul 1979

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume70 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Symposium on Semantics of Concurrent Computation, 1979
Country/TerritoryFrance
CityEvian
Period2/07/794/07/79

Fingerprint

Dive into the research topics of 'Notion de Dualite et de Symetrie dans les Reseaux de Petri'. Together they form a unique fingerprint.

Cite this