Anzeige
Erschienen in:
1983 | OriginalPaper | Buchkapitel
A Graph Theoretical Property for Minimal Deadlock
verfasst von : G. Memmi
Erschienen in: Applications and Theory of Petri Nets
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
There are at least two main reasons for studying classes of Petri nets. First, many systems are specified as sets of communicating sequential processes, with formal rules of construction which give birth to special kind of structures ([Her 79], [BMR 80] or [LSB 79]). The second is theoretical. Analysis algorithms have an exponential complexity. In assuming some constraints on the structure of the net, one can hope to decrease this complexity substantially.