Correction to “Synchronizing sequences on a class of unbounded systems using synchronized Petri nets”

  • 30 Accesses


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.

This is a preview of subscription content, log in to check access.

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 99

This is the net price. Taxes to be calculated in checkout.

Fig. 1
Fig. 2


  1. 1.

    Given two vectors M, \(M^{\prime }\in \mathbb {N}^{m}\), we write \(M\lneq M^{\prime }\) if each component of M is less than or equal to the corresponding one of \(M^{\prime }\) and \(M\neq M^{\prime }\).

  2. 2.

    By convention, an inhibitor arc is graphically represented by an arc connected to a transition by a small circle.


  1. Brams GW (1983) Petri nets: Theory and Practice (in French) Masson

  2. David R, Alla H (2005) Discrete, Continuous, and Hybrid Petri Nets, vol 1. Springer, Berlin

  3. Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(2):147–195

  4. Moalla M, Pulou J, Sifakis J (1978) Synchronized Petri nets: A model for the description of non-autonomous sytems. In: International Symposium on Mathematical Foundations of Computer Science, Springer, pp 374–384

  5. Pocci M, Demongodin I, Giambiasi N, Giua A (2016) Synchronizing sequences on a class of unbounded systems using synchronized Petri nets. Discrete Event Dyn Syst 26(1):85–108

Download references

Author information

Correspondence to Changshun Wu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by Region Sardinia, FSC 2014 – 2020, project RASSR05871 -MOSIMA.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wu, C., Demongodin, I. & Giua, A. Correction to “Synchronizing sequences on a class of unbounded systems using synchronized Petri nets”. Discrete Event Dyn Syst 29, 521–526 (2019) doi:10.1007/s10626-019-00295-9

Download citation


  • Synchronized Petri nets
  • Unbounded nets
  • Coverability graph
  • Repetitive sequences