Skip to main content
SpringerLink
Log in

Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets

基于网结构的判定一类跨组织工作流网兼容性与弱兼容性的充要条件

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

Abstract

Inter-organizational workflow nets (IWF-nets) can well model the interactions among multiple processesby sending/receiving messages. Compatibility and weak compatibility are crucial properties for IWF-nets.The latter guarantees that a system is deadlock-free and livelock-free while the former also guarantees that ithas no dead tasks. Our previous work proved that the (weak) compatibility problem is PSPACE-complete forsafe IWF-nets. This paper defines a class of IWF-nets in which some simple circuits are allowed. Necessaryand sufficient conditions are presented to decide compatibility and weak compatibility for this class, and theyare dependent on the net structures only. Algorithms are developed based on these conditions. In addition, weshow that the traditional net structures like siphon cannot be easily used to decide the (weak) compatibility ofIWF-nets.

创新点

跨组织工作流网广泛用于模拟与分析多个业务流程间的交互, 这些交互通过消息传递来实现。弱兼容性保证业务流程交互时既无死锁也无活锁, 而兼容性同时还保证业务流程的每个事件都有可能发生。然而, 我们前期工作证明: 对有界跨组织工作流网来说, 判定其 (弱) 兼容性是PSPACE完全的。因此, 为一些子类寻找有效判定条件是非常有意义的。本文定义了一类跨组织工作流网, 提出了新的网结构概念, 并基于这些网结构概念给出了判定 (弱) 兼容性的充要条件。

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. Ezpeleta J, Colom J M, Martinez J. A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans Robot Automat, 1995, 11: 173–184

    Article  Google Scholar 

  2. Li Z W, Zhou M C. Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturingsystems. IEEE Trans Syst Man Cybern: Part A, 2004, 34: 38–51

    Article  Google Scholar 

  3. Wang S G, Wang C, Zhou M C. Controllability conditions of resultant siphons in a class of Petri nets. IEEE TransSyst Man Cybern: Part A, 2012, 42: 1206–1215

    Article  Google Scholar 

  4. Wu N Q, Zhou M C. Deadlock resolution in automated manufacturing systems with robots. IEEE Trans Automat SciEng, 2007, 4: 474–480

    Article  Google Scholar 

  5. Xue L, Hao Y. Autonomy-subnet based structural synthesis and liveness guarantying policy of Petri net model offlexible manufacturing system. Sci China-Ser F: Info Sci, 2004, 47: 273–286

    Article  MATH  MathSciNet  Google Scholar 

  6. Xing K Y, Zhou M C, Wang F, et al. Resource-transition circuits and siphons for deadlock control of automatedmanufacturing systems. IEEE Trans Syst Man Cybern: Part A, 2011, 41: 74–84

    Article  Google Scholar 

  7. Aalst W M P. Interorganizational workflows: an approach based on message sequence charts and Petri nets. Syst AnalModel Simul, 1999, 34: 335–367

    MATH  Google Scholar 

  8. Aalst W M P, Mooij A J, Stahl C, et al. Service interaction: patterns, formalization, and analysis. Lect Notes ComputSci, 2009, 5569: 42–88

    Article  Google Scholar 

  9. van He K, Sidorova N, Voorhoeve M. Generalized soundness of workflow nets is decidable. Lect Notes Comput Sci,2004, 3099: 197–216

    Article  Google Scholar 

  10. Kim T H, Chang C K, Mitra S. Design of service-oriented systems using SODA. IEEE Trans Serv Comput, 2010, 3:236–249

    Article  Google Scholar 

  11. Kindler E. The ePNK: an extensible Petri net tool for PNML. Lect Notes Comput Sci, 2011, 6709: 318–327

    Article  Google Scholar 

  12. Aalst W M P. The application of Petri nets to workflow management. J Circuit Syst Comp, 1998, 8: 21–66

    Article  Google Scholar 

  13. Aalst W M P, van Hee K M, ter Hofstede A H M, et al. Soundness of workflow nets: classification, decidability, andanalysis. Form Asp of Comput, 2011, 23: 333–363

    Article  MATH  Google Scholar 

  14. Liu G J, Jiang C J, Zhou M C, et al. Interactive Petri nets. IEEE Trans Syst Man Cybern: Syst, 2013, 43: 291–302

    Article  Google Scholar 

  15. Tiplea F L, Marinescu D C. Structural soundness of workflow nets is decidable. Inform Process Lett, 2005, 96: 54–58

    Article  MATH  MathSciNet  Google Scholar 

  16. Liu G J, Sun J, Liu Y, et al. Complexity of the soundness problem of workflow nets. Fundam Inform, 2014, 131:81–101

    MATH  Google Scholar 

  17. AalstWM P. Workflow verification: Fingding control-flow errors using Petri-net-based techniques. Lect Notes ComputSci, 2000, 1806: 161–183

    Article  Google Scholar 

  18. Desel J, Esparza J. Free Choice Petri Nets. Cambridge: Cambridge University Press, 1995

    Book  Google Scholar 

  19. Liu G J. Some complexity results for the soundness problem of workflow nets. IEEE Trans Serv Comput, 2014, 7:322–328

    Article  Google Scholar 

  20. Weidlich M, Mendling J, Weske M. Efficient consistency measurement based on behavioral profiles of process models. IEEE Trans Softw Eng, 2011, 37: 410–429

    Article  Google Scholar 

  21. Stahl C, Wolf K. Deciding service composition and substitutability using extended operating guidelines. Data KnowlEng, 2009, 68: 819–833

    Article  Google Scholar 

  22. Tan W, Fan Y S, Zhou M C. A Petri net-based method for compatibility analysis and composition of Web services inbusiness process execution language. IEEE Trans Autom Sci Eng, 2009, 6: 94–106

    Article  Google Scholar 

  23. Che X, Maag S. Testing protocols in Internet of Things by a formal passive technique. Sci China Inf Sci, 2014, 57:032101

  24. Gierds C, Mooij A J, Wolf K. Reducing adapter synthesis to controller synthesis. IEEE Trans Serv Comput, 2012, 5:72–85

    Google Scholar 

  25. Martens A. On compatibility of web services. Petri Net Newslett, 2003, 65: 12–20

    Google Scholar 

  26. Fahland D, Favre C, Koehler J, et al. Analysis on demand: instantaneous soundness checking of industrial businessprocess models. Data Knowl Eng, 2011, 70: 448–466

    Article  Google Scholar 

  27. Wolf K. Generating Petri net state space. Lect Notes Comput Sci, 2007, 4546: 29–42

    Article  Google Scholar 

  28. Best E. Structure theory of Petri nets: the free choice hiatus. Lect Notes Comput Sci, 1987, 254: 168–205

    Article  MathSciNet  Google Scholar 

  29. Wang S G, Wang C, Zhou M C, et al. A method to compute strict minimal siphons in S3PR based on loop resourcesubsets. IEEE Trans Syst Man Cybern: Part A, 2012, 42: 226–237

    Article  MATH  Google Scholar 

  30. Baldan P, Corradini A, Ehrig H, et al. Compositional semantics for open Petri nets based on deterministic processes. Math Struct Comput Sci, 2005, 15: 1–35

    Article  MATH  MathSciNet  Google Scholar 

  31. Murata T. Petri nets: properties, analysis and applications. Proc IEEE, 1989, 77: 541–580

    Article  Google Scholar 

  32. Reisig W. Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Berlin/Heidelberg: Springer-Verlag, 2013

    Book  Google Scholar 

  33. Barkaoui K, Couvreur J M, Dutheillet C. On liveness in extended non self-controlling nets. Lect Notes Comput Sci,1995, 935: 25–44

    Article  MathSciNet  Google Scholar 

  34. Chu F, Xie X L. Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Trans RobotAutomat, 1997, 13: 793–840

    Google Scholar 

  35. Jiao L, Cheung T Y, Lu W M. On liveness and boundedness of asymmetric-choice nets. Theor Comput Sci, 2004, 311:165–197

    Article  MATH  MathSciNet  Google Scholar 

  36. Liu G J, Chen L J. Sufficient and necessary condition to decide compatibility for a class of interorganizational workflownets. Math Probl Eng, 2014, 2014: 392945

  37. Aalst W M P, Kindler E, Desel J. Beyond asymmetric choice: a note on some extensitons. Petri Net Newslett, 1998,55: 3–13

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    GuanJun Liu & ChangJun Jiang

  2. Key Laboratory of the Ministry of Education for Embedded System and Service 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. ChangJun Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to GuanJun Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, G., Jiang, C. Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets. Sci. China Inf. Sci. 58, 1–16 (2015). https://doi.org/10.1007/s11432-014-5259-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-014-5259-5

Keywords

关键词

Search

Navigation