Skip to main content
SpringerLink
Log in

Deciding the Deadlock and Livelock in a Petri Net with a Target Marking Based on Its Basic Unfolding

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10048))

Abstract

Petri nets are widely used to model and analyse concurrent systems. It is an important study to check the deadlock and/or livelock in Petri nets. These checks are generally carried out by the reachability graph technique and thus the state explosion problem is a big obstacle to this technique. The unfolding technique can effectively avoid/alleviate the state explosion problem, especially for those Petri nets that have many concurrent actions. This paper considers the deadlock and livelock problem in a Petri net with a target state. We propose the notion of basic unfolding. Based on basic unfolding, we present a necessary and sufficient condition to decide whether a Petri net is both deadlock-free and livelock-free.

G. Liu—This paper was supported in part by the National Nature Science Foundation of China (Grant Nos. 61572360 and 91218301) and in part by the Shanghai Shuguang Program.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. van der Aalst, W.M.P.: Workflow verification: finding control-flow errors using Petri-Net-Based techniques. In: Aalst, W.M.P., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161–183. Springer, Heidelberg (2000). doi:10.1007/3-540-45594-9_11

    Chapter  Google Scholar 

  2. Bonet, B., Haslum, P., Khomenko, V., Thiebaux, S., Vogler, W.: Recent advances in unfolding technique. Theoret. Comput. Sci. 551, 84–101 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.: Modeling Chencking, 1st edn. The MIT Press, Cambridge (1999)

    Google Scholar 

  4. Couvreur, J.M., Poitrenaud, D., Weil, R.: Branching processes of general Petri nets. Fundamenta Informaticae 122, 31–58 (2013)

    MathSciNet  MATH  Google Scholar 

  5. Chu, F., Xie, X.L.: Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Trans. Robot Automat. 13, 793–840 (1997)

    Article  Google Scholar 

  6. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  7. Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28, 575–591 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Esparza, J., Heljanko, K.: Unfoldings: A Partial-Order Approach to Model Checking. Springer-Verlag, Berlin (2008)

    MATH  Google Scholar 

  9. Esparza, J., Romer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Form. Methods Syst. Des. 20(3), 285–310 (2002)

    Article  MATH  Google Scholar 

  10. Khomenko, V.: Model checking based on prefixes of Petri net unfoldings. University of Newcastle upon Tyne (Ph.D. Dissertation) (2003)

    Google Scholar 

  11. Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Informatica 40, 95–118 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, G.J., Liu, C.J., Chao, D.: A necessary and sufficient condition for the liveness of normal nets. Comput. J. 54, 157–163 (2011)

    Article  Google Scholar 

  13. Liu, G.J., Jiang, C.J., Zhou, M.C., Ohta, A.: The liveness of WS\(^3\)PR: complexity and decision. IEICE Trans. Fundam. E96–A, 1783–1793 (2013)

    Article  Google Scholar 

  14. Liu, G.J., Reisig, W., Jiang, C.J., Zhou, M.C.: A branching-process-based method to check soundness of workflow systems. IEEE Access 4, 4104–4118 (2016)

    Article  Google Scholar 

  15. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Berlin (1993)

    Book  MATH  Google Scholar 

  16. McMillan, K.L.: A technique of state space search based on unfolding. Formal Meth. Syst. Des. 6, 45–65 (1995)

    Article  MATH  Google Scholar 

  17. Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)

    Book  MATH  Google Scholar 

  18. Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998). doi:10.1007/3-540-65306-6_21

    Chapter  Google Scholar 

  19. Dingle, N.J., Knottenbelt, W.J., Suto, T.: PIPE2: a tool for the performance evaluation of generalised stochastic Petri Nets. ACM SIGMETRICS Perform. Eval. Rev. 36(4), 34–39 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tongji University, Shanghai, 201804, China

    Guanjun Liu & Kun Zhang

  2. Key Lab of the Ministry of Education for Embedded Systems and Services Computing, Tongji University, Shanghai, 201804, China

    Guanjun Liu & Changjun Jiang

Authors
  1. Guanjun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Changjun Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanjun Liu .

Editor information

Editors and Affiliations

  1. University Carlos III of Madrid, Leganes, Spain

    Jesus Carretero

  2. Carlos III University of Madrid, Leganes, Madrid, Spain

    Javier Garcia-Blas

  3. The University of Waikato, Hamilton, New Zealand

    Ryan K.L. Ko

  4. IBM Zurich Research Laboratory, Rüschlikon, Switzerland

    Peter Mueller

  5. Hiroshima University, Higashi-Hiroshima, Japan

    Koji Nakano

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Liu, G., Zhang, K., Jiang, C. (2016). Deciding the Deadlock and Livelock in a Petri Net with a Target Marking Based on Its Basic Unfolding. In: Carretero, J., Garcia-Blas, J., Ko, R., Mueller, P., Nakano, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2016. Lecture Notes in Computer Science(), vol 10048. Springer, Cham. https://doi.org/10.1007/978-3-319-49583-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49583-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49582-8

  • Online ISBN: 978-3-319-49583-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation