Correction to “Synchronizing sequences on a class of unbounded systems using synchronized Petri nets” | Discrete Event Dynamic Systems Skip to main content
Springer Nature Link
Log in

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

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  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. By convention, an inhibitor arc is graphically represented by an arc connected to a transition by a small circle.

References

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

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

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • 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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIS, Aix-Marseille Université, Université de Toulon, Marseille, France

    Changshun Wu & Isabel Demongodin

  2. DIEE, University of Cagliari, Cagliari, Italy

    Alessandro Giua

Authors
  1. Changshun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isabel Demongodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alessandro Giua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

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

Check for updates. 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). https://doi.org/10.1007/s10626-019-00295-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-019-00295-9

Keywords

Search

Navigation