Skip to main content
SpringerLink
Log in

Property analysis of logic Petri nets by marking reachability graphs

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Logic Petri nets (LPNs) are suitable to describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. To investigate the dynamic properties of LPNs directly, a new method for analyzing LPNs is proposed based on marking reachability graphs in this paper. Enabled conditions of transitions are obtained and a marking reachability graph is constructed. All reachable markings can be obtained based on the graph; the fairness and reversibility of LPNs are analyzed. Moreover, the computing complexity of the enabled conditions and reachable markings can be reduced by this method. The advantages of the proposed method are illustrated by examples and analysis.

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

Similar content being viewed by others

References

  1. Hruz B, Zhou M C. Modeling and control of discrete event dynamic systems. London: Springer, 2007

    MATH  Google Scholar 

  2. Du Y Y, Jiang C J, Zhou M C. A Petri net-based model for verification of obligations and accountability in cooperative systems. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 2008, 39(2): 299–308

    Article  MathSciNet  Google Scholar 

  3. Du Y Y, Jiang C J, Zhou M C. A Petri net based correctness analysis of internet stock trading systems. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2008, 38(1): 93–99

    Article  Google Scholar 

  4. Deng S Y, Du Y Y. Logic Petri net based model for Web service cluster. Journal of Computer Applications, 2012, 32(8): 2328–2337

    Article  Google Scholar 

  5. Du Y Y, Jiang C J, Zhou M C. A Petri net-based model for verification of obligations and accountability in cooperative systems. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 2009, 39(2): 299–308

    Article  Google Scholar 

  6. Kusiak A, Yang H H. Modeling design cycles with stochastic Petri nets. American Society of Mechanical Engineers. Production Engineering Division PED, 1992 59(8): 375–385

    Google Scholar 

  7. Tan W, Fan Y S, Zhou M C, Tian Z. Data-driven service composition in building SOA solutions: a Petri net approach. IEEE Transactions on Automation Science and Engineering, 2010, 7(3): 686–694

    Article  Google Scholar 

  8. Xiong P C, Fan Y, Zhou M C. A Petri net approach to analysis and composition of web services. IEEE Transactions on Systems, Manand Cybernetics, Part A: Systems and Humans, 2010, 40(2): 376–387

    Article  Google Scholar 

  9. Du Y Y, Guo B Q. Logic Petri nets and equivalency. Information Technology Journal, 2009, 8(1): 95–100

    Article  MathSciNet  Google Scholar 

  10. Du Y Y, Jiang C J. Formal representation and analysis of batch stock trading systems by logical Petri net workflows. Lecture Notes in Computer Science, 2002, 2495: 221–225

    Article  Google Scholar 

  11. Busi N. Analysis issues in Petri nets with inhibitor arcs. Theoretical Computer Science, 2002, 275(1): 127–177

    Article  MATH  MathSciNet  Google Scholar 

  12. Du Y Y, Qi L, Zhou M C. A vector matching method for analyzing logic Petri nets. Enterprise Information Systems, 2011, 5(4): 449–468

    Article  Google Scholar 

  13. Robidoux R, Xu H, Xing L D, Zhou M C. Automated verification of dynamic reliability block diagrams using colored Petri nets. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 2010, 40(4): 337–351

    Article  Google Scholar 

  14. Hu H, Zhou MC, Li Z. Liveness enforcing supervision of video streaming systems using non-sequential Petri nets. IEEE Transactions on Multimedia, 2009, 11(8): 1446–1456

    Article  Google Scholar 

  15. Li J, Zhou M, Dai X. Algebraic reduction and refinement of Petri nets. IEEE Transactions on Systems, Man and Cybernetics: Part A: Systems and Humans, 2012, 42(7): 1244–1255

    Article  Google Scholar 

  16. Liu D, Li ZW, Zhou M C. Liveness of an extended S3PR. Automatica, 2010, 46(6): 1008–1018

    Article  MATH  MathSciNet  Google Scholar 

  17. Liu G, Jiang C, Zhou M C. Two simple deadlock prevention policies for S3PR based on key resource/operation-place pairs. IEEE Transactions on Automation Science and Engineering, 2010, 7(4): 945–957

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590, China

    Yuyue Du & Yuhui Ning

Authors
  1. Yuyue Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuhui Ning
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuhui Ning.

Additional information

Yuyue Du received his BS degree from Shandong University, Jinan, China in 1982, his MS degree from Nanjing University of Aeronautics and Astronautics, Nanjing, China in 1991, and his PhD degree in computer applications from Tongji University, Shanghai, China in 2003. He is currently a professor in the College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, China. He is a member of the Professional Committee of Petri Nets of the China Computer Federation. His research interests are in formal engineering, Petri nets, real-time systems, Web services, and workflows. He has taken in over ten projects supported by the National Natural Science Foundation of China, National Key Basic Research Developing Program of China, and other important and key projects at provincial levels. He has published more than 140 papers in domestic and international academic publications, with more than 80 SCI and EI citations, and a total of more than 270 citations.

Yuhui Ning received his BSc degree and MSc degree in computer science and technology from Shandong University of Science and Technology, Qingdao, China in 2005 and 2008, respectively. He is currently a PhD candidate in computer software and theory in the College of Information Science and Engineering, Shandong University of Science and technology, Qingdao, China. His research interests include Petri nets, Web services, and workflow theory.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Du, Y., Ning, Y. Property analysis of logic Petri nets by marking reachability graphs. Front. Comput. Sci. 8, 684–692 (2014). https://doi.org/10.1007/s11704-014-3002-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-014-3002-9

Keywords

Search

Navigation