Skip to main content
SpringerLink
Log in

New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Karp R M, Miller R E. Parallel program schemata. J Comput Syst Sci, 1969, 3: 147–195

    Article  MathSciNet  Google Scholar 

  2. Wang F Y, Gao Y, Zhou M C. A modified reachability tree approach to analysis of unbounded Petri nets. IEEE Trans Syst Man Cybern B, 2004, 34: 303–308

    Article  Google Scholar 

  3. Ru Y, Wu W M, Hadjicostis C. Comments on “a modified reachability tree approach to analysis of unbounded Petri nets”. IEEE Trans Syst Man Cybern B, 2006, 36: 1210

    Article  Google Scholar 

  4. Wang S G, Zhou M C, Li Z W, et al. A new modified reachability tree approach and its applications to unbounded Petri nets. IEEE Trans Syst Man Cybern Syst, 2013, 43: 932–940

    Article  Google Scholar 

  5. Wang S G, Gan M D, Zhou M C. Macro liveness graph and liveness of ω-independent unbounded nets. Sci China Inf Sci, 2015, 58: 032201

    MATH  Google Scholar 

  6. Ginsburg S, Spanier E. Semigroups, Presburger formulas, and languages. Pac J Math, 1966, 16: 285–296

    Article  MathSciNet  Google Scholar 

  7. Hauschildt D. Semilinearity of the reachability set is decidable for Petri nets. Dissertation for Ph.D. Degree. Hamburg: University of Hamburg, 1990

    Google Scholar 

  8. Lambert J L. Vector addition systems and semilinearity. SIAM J Comput, 1994

    Google Scholar 

  9. Yen H C. Path decomposition and semilinearity of Petri nets. Int J Found Comput Sci, 2009, 20: 581–596

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 61374148).

Author information

Authors and Affiliations

  1. Department of Electronic and Information Engineering, Zhejiang Gongshang University, Hangzhou, 310018, China

    Shouguang Wang & Dan You

  2. Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Mengchu Zhou

Authors
  1. Shouguang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan You
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mengchu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Shouguang Wang or Mengchu Zhou.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, S., You, D. & Zhou, M. New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets. Sci. China Inf. Sci. 61, 129104 (2018). https://doi.org/10.1007/s11432-017-9446-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9446-3

Search

Navigation