Discrete Event Dynamic Systems

, Volume 29, Issue 4, pp 521–526 | Cite as

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

  • Changshun WuEmail author
  • Isabel Demongodin
  • Alessandro Giua


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.


Synchronized Petri nets Unbounded nets Coverability graph Repetitive sequences 



  1. Brams GW (1983) Petri nets: Theory and Practice (in French) MassonGoogle Scholar
  2. David R, Alla H (2005) Discrete, Continuous, and Hybrid Petri Nets, vol 1. Springer, BerlinzbMATHGoogle Scholar
  3. Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(2):147–195MathSciNetCrossRefGoogle Scholar
  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–384CrossRefGoogle Scholar
  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–108MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.CNRS, LISAix-Marseille Université, Université de ToulonMarseilleFrance
  2. 2.DIEEUniversity of CagliariCagliariItaly

Personalised recommendations