Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Discrete Parameters in Petri Nets
verfasst von : Nicolas David, Claude Jard, Didier Lime, Olivier H. Roux
Erschienen in: Application and Theory of Petri Nets and Concurrency
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
With the aim of significantly increasing the modeling capability of Petri nets, we suggest that models involve parameters to represent the weights of arcs, or the number of tokens in places. We consider the property of coverability of markings. Two general questions arise: “Is there a parameter value for which the property is satisfied?" and “Does the property hold for all possible values of the parameters?". We show that these issues are undecidable in the general case. Therefore, we also define subclasses of parameterised networks, depending on whether the parameters are used on places, input or output arcs of transitions. For some subclasses, we prove that certain problems become decidable, making these subclasses more usable in practice.