We study the computation of admissible marking sets in generalized Petri nets. We first show that the admissibility checking in the generalized Petri net is NP-hard. Then, we consider a special subclass of generalized Petri nets called weighted-synchronization-free nets in which each transition has at most one input place. For a net in this subclass, we propose a generating function to compute by dynamic programming the set of admissible markings for a given generalized mutual exclusion constraint.
Computation of admissible marking sets in weighted synchronization-free petri nets by dynamic programming
Ma Z.;Li Z.;Giua A.
2020-01-01
Abstract
We study the computation of admissible marking sets in generalized Petri nets. We first show that the admissibility checking in the generalized Petri net is NP-hard. Then, we consider a special subclass of generalized Petri nets called weighted-synchronization-free nets in which each transition has at most one input place. For a net in this subclass, we propose a generating function to compute by dynamic programming the set of admissible markings for a given generalized mutual exclusion constraint.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
20tac_b.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
608.08 kB
Formato
Adobe PDF
|
608.08 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
