Correction to “Synchronizing sequences on a class of unbounded systems using synchronized Petri nets”
- 18 Downloads
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.
KeywordsSynchronized Petri nets Unbounded nets Coverability graph Repetitive sequences
- Brams GW (1983) Petri nets: Theory and Practice (in French) MassonGoogle Scholar