Skip to main content
SpringerLink
Log in

A Reduction Method of Analyzing Data-Liveness and Data-Boundedness for a Class of E-commerce Business Process Nets

  • Conference paper
  • First Online:
Security, Privacy, and Anonymity in Computation, Communication, and Storage (SpaCCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10066))

  • 1425 Accesses

Abstract

E-commerce Business Process Nets (EBPNs for short) are a novel formal model of describing and verifying e-commerce business processes with multiple interactive parties. They can well reflect some behavior-security properties such as data-live and data-boundedness. However, the problem of effectively analyzing EBPNs remains largely open since data are considered in them. In this paper, a class of EBPNs called S-graph-Reducible EBPN (RENS for short) is defined. Some restrictions are set on the structure of a RENS and thus each RENS can be reduced to a marked S-graph. We prove that a RENS and the related marked S-graph are equivalent on behaviors. Thus, the properties of RENS such as data-liveness, data-boundedness, and reachability can be analyzed easily based on the methods applied in the marked S-graphs.

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. iResearch: 2015 Q2 e-commerce market core data (2015). http://news.iresearch.cn/zt/256178.shtml

  2. CNNIC: 36th China Internet development statistics report. China Internet Network Information Center, Beijing, China, July 2015

    Google Scholar 

  3. Wang, R., Chen, S., Wang, X.F., Qadeer, S.: How to shop for free online-security analysis of cashier-as-a-service based web stores. In: Proceedings of the 32nd IEEE Symposium Security Privacy, Berkeley, CA, pp. 465–480 (2011)

    Google Scholar 

  4. CNNIC: Q3 Chinese Internet security report. China Internet Network Information Center, Beijing, China, November 2015

    Google Scholar 

  5. Georgiadis, C.K., Pimenidis, E.: Web services enabling virtual enterprise transactions. In: Proceedings of IADIS International Conference on E-Commerce, Barcelona, Spain, pp. 297–302 (2006)

    Google Scholar 

  6. Pfitzmann, B., Waidner, M.: Properties of payment systems: general definition scetch and classification. IBM Research Division Research Report RZ 2823 (#90126), May 1996

    Google Scholar 

  7. Hoglund, G., McGraw, G.: Exploiting Software: How to Break Code. Pearson Education, India (2004)

    Google Scholar 

  8. Viega, G.: McGraw : Building Secure Software. Ohmsha, Tokyo (2006)

    Google Scholar 

  9. State of Application Security Report. https://www.securityinnovation.com/company/news-and-events/press-releases/state-of-application-security-report.html

  10. Yu, W.Y., Yan, C.G., Jiang, C.J., et al.: Modeling and validating e-commerce business process based on Petri nets. IEEE Trans. Syst. Man Cybern. Syst. 44(3), 327–341 (2014)

    Article  Google Scholar 

  11. Yu, W.Y., Yan, C.G., Jiang, C.J., et al.: Modeling and verification of online shopping business processes by considering malicious behavior patterns. IEEE Trans. Autom. Sci. Eng. 13(2), 647–662 (2016)

    Article  Google Scholar 

  12. Bhargavan, K., Fournet, C., Gordon, A.D.: Modular verification of security protocol code by typing. In: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium Principles Programming Languages, New York, USA, pp. 445–456 (2010)

    Google Scholar 

  13. Ray, I., Natarajan, N.: An anonymous and failure resilient fair-exchange e-commerce protocol. Decis. Support Syst. 39(3), 267–292 (2005)

    Article  Google Scholar 

  14. Wang, Z.K.: Analyzing a fair exchange e-commerce protocol using CSP and FDR. In: Proceedings of the International Conference on E-Education, E-Business, E-Management, E-Learning, Sanya, China, pp. 303–307 (2010)

    Google Scholar 

  15. Neumann, P.: Principled assuredly trustworthy composable architectures. SRI International Computer Science Laboratory, Menlo Park, USA, Contract N66001–01-C-8040, December 2004

    Google Scholar 

  16. Latham, D.C.: Department of Defense Trusted Computer System Evaluation Criteria. US Department of Defense, vol. 5200.28-STD, ed (1985)

    Google Scholar 

  17. Hrz, B., Zhou, M.C.: Modeling and control of discrete-event dynamic systems. Springer, London (2007)

    Google Scholar 

  18. Liu, G.J., Jiang, C.J.: Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets. Sci. China Inf. Sci. 58(7), 1–16 (2015). Article number 072103

    Article  Google Scholar 

  19. van der Aalst, W.M.P., Lohmann, N., La Rosa, M.: Ensuring correctness during process configuration via partner synthesis. Inf. Syst. 37(6), 574–592 (2012)

    Article  Google Scholar 

  20. Du, Y.Y., Jiang, C.J., Zhou, M.C.: A Petri net-based model for verification of obligations and accountability in cooperative systems. IEEE Trans. Syst. Man Cybern. A Syst. Hum. 39(2), 299–308 (2009)

    Article  Google Scholar 

  21. Du, Y.Y., Jiang, C.J., Zhou, M.C., et al.: Modeling and monitoring of E-commerce workflows. Inf. Sci. 179(7), 995–1006 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  22. Du, Y.H., Li, X.T., Xiong, P.C.: A Petri net approach to mediation-aided composition of web services. IEEE Trans. Autom. Sci. Eng. 9, 429–435 (2012)

    Article  Google Scholar 

  23. Wang, S.G., Huang, L., Sun, L., et al.: Efficient and reliable service selection for heterogeneous distributes software systems. Future Gener. Comp. Syst. (2016, in press)

    Google Scholar 

  24. Wang, S.G., Hsu, C.H., Liang, Z.J., et al.: Multi-user web service selection based on multi-QoS prediction. Inf. Syst. Front. 16(1), 143–152 (2014)

    Article  Google Scholar 

  25. Jensen, K., Kristensen, L.M.: Coloured Petri Nets: Modeling and Validation of Concurrent Systems. Springer, New York (2009)

    Book  MATH  Google Scholar 

  26. Wu, Z.H.: Introduction to Petri Nets. Machine Press, Beijing (2006)

    Google Scholar 

  27. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  28. Zhou, M.C., Venkatesh, K.: Modeling, Simulation, and Control of Flexible Manufacturing Systems: A Petri Net Approach. World Scientific Publishing, Singapore (1999)

    Book  Google Scholar 

  29. Wu, N.Q., Zhou, M.C.: System Modeling and Control with Resource-Oriented Petri Nets. CRC Press, New York (2010)

    Google Scholar 

  30. Liu, G.J., Jiang, C.J., Zhou, M.C., et al.: Interactive Petri nets. IEEE Trans. Syst. Man Cybern. A Syst. Hum. 43(2), 291–302 (2013)

    Article  Google Scholar 

  31. Liu, G.J., Jiang, C.J., Zhou, M.C.: Process nets with channels. IEEE Trans. Syst. Man Cybern. A Syst. Hum. 42(1), 213–225 (2012)

    Article  Google Scholar 

  32. Watanabe, T., Mizobataand, Y., Onaga, K.: Legal firing sequences and related problems of Petri nets. In: Proceedings of the 3rd International Workshop on Petri Nets and Performance Models (PNPM1989), pp. 277–286. IEEE Computer Society Press (1989)

    Google Scholar 

  33. Watanabe, T., Mizobataand, Y., Onaga, K.: Legal firing sequences and minimum initial markings for Petri nets. In: Proceedings of the 1989 IEEE International Symposium on Circuits and Systems, pp. 323–326 (1989)

    Google Scholar 

  34. Watanabe, T.: Time complexity of legal firing sequences and related problems of Petri nets. Trans. IEICE Jpn. 72(12), 1400–1409 (1989)

    Google Scholar 

  35. Jiang, C.J.: Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets. Sci. China (Ser. F Inf. Sci.) 44(3), 226–233 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This paper is in part supported by the National Natural Science Foundation of China under Grants 41271387, 61572360, 61602289, 11372167 and 61303092, by the Fundamental Research Funds for the Central Universities of China under Grants GK201503061 and GK200902018, by the Natural Science Basic Research Plan in Shaanxi Province of China under Grants 2016JQ6056, by the Program of Key Science and Technology Innovation Team in Shaanxi Province under Grant 2014KTC-18, by the Postgraduate Education Reform Project of Shaanxi Normal University under grant GERP-15-12, by the Shanghai Education Development Foundation and Shanghai Municipal Education Commission (Shuguang Program).

Author information

Authors and Affiliations

  1. Ministry of Education Key Laboratory for Modern Teaching Technology, Shaanxi Normal University, Xi’an, 710119, China

    Wangyang Yu

  2. School of Computer Science, Shaanxi Normal University, Xi’an, 710062, China

    Wangyang Yu

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

    Guanjun Liu & Leifeng He

  4. The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai, 200092, China

    Wangyang Yu, Guanjun Liu & Leifeng He

Authors
  1. Wangyang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guanjun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leifeng He
    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. Guangzhou University, Guangzhou, China

    Guojun Wang

  2. Department of Computer Science, Colorado State University, Fort Collins, Colorado, USA

    Indrakshi Ray

  3. University of the West of Scotland, Paisley, Glasgow, United Kingdom

    Jose M. Alcaraz Calero

  4. Indian Institute of Information Technology and Management, Kerala (IIITMK), Trivandrum, Kerala, India

    Sabu M. Thampi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Yu, W., Liu, G., He, L. (2016). A Reduction Method of Analyzing Data-Liveness and Data-Boundedness for a Class of E-commerce Business Process Nets. In: Wang, G., Ray, I., Alcaraz Calero, J., Thampi, S. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2016. Lecture Notes in Computer Science(), vol 10066. Springer, Cham. https://doi.org/10.1007/978-3-319-49148-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49148-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49147-9

  • Online ISBN: 978-3-319-49148-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation