The paper mentioned in the title proposed a new definition of increasing repetitive input sequences for synchronized Petri nets and stated that it can be used to construct a finite modified coverability graph for any unbounded SynPN. In this note, we discuss the notion of unboundedness for SynPNs and show via an example that actually the modified coverability graph may be infinite due the presence of increasing sequences that are not repetitive.
Correction to “Synchronizing sequences on a class of unbounded systems using synchronized Petri nets”
Giua A.Ultimo
2019-01-01
Abstract
The paper mentioned in the title proposed a new definition of increasing repetitive input sequences for synchronized Petri nets and stated that it can be used to construct a finite modified coverability graph for any unbounded SynPN. In this note, we discuss the notion of unboundedness for SynPNs and show via an example that actually the modified coverability graph may be infinite due the presence of increasing sequences that are not repetitive.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
19deds_b.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
594.47 kB
Formato
Adobe PDF
|
594.47 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.
