Abstract
Inter-organization workflow nets (IWF-nets) can well model the interactions among multiple business processes by sending/receiving messages, and their compatibility is a very important property to guarantee that their logical behaviors are correct. Liu and Jiang introduce a class of IWF-nets named SCIWF-nets (simple circuit IWF-nets) to model inter-organizational business processes and this class can model many cases of interactions. In this paper, a necessary and sufficient condition is presented to decide compatibility for SCIWF-nets and it is dependent on the net structures only. This structure-based condition lays a foundation for designing an efficient algorithm to check compatibility of SCIWF-nets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aalst, W.M.P.: Interorganizational workflows: an approach based on message sequence charts and Petri nets. Syst. Anal. Model. Simul. 34, 335–367 (1999)
Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circuit Syst. Comp. 8, 21–66 (1998)
Aalst, W.M.P.: Workflow verification: finding control-flow errors using petri-net-based techniques. In: Aalst, W., 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
Aalst, W.M.P., Mooij, A.J., Stahl, C., Wolf, K.: Service interaction: patterns, formalization, and analysis. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 42–88. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01918-0_2
Barkaoui, K., Ben Abdallah, I.: Structural liveness analysis of \(S^3PR\) nets. In: Symposium on Discrete Events and Manufacturing Systems, CESA 1996 IMACS Multiconference, pp. 438–443, January 1996
Chao, D., Li, Z.W.: Structural conditions of systems of simple sequential processes with resources nets without weakly dependent siphons. IET Control Theory Appl. 3, 391–403 (2009)
Chu, F., Xie, X.: Deaklock analysis of Petri nets using siphons and mathematical programming. IEEE Trans. Robot. Autom. 13(6), 793–804 (1997)
Colom, J.M.: The resource allocation problem in flexible manufacturing systems. In: Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 23–35. Springer, Heidelberg (2003). doi:10.1007/3-540-44919-1_3
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)
Fanti, M.P., Zhou, M.C.: Deaklock control methods in automated manufacturing systems. IEEE Trans. Syst. Man Cybern. A. 34, 5–22 (2004)
Hee, K., Sidorova, N., Voorhoeve, M.: Generalised soundness of workflow nets is decidable. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 197–215. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27793-4_12
Jeng, M.D., Xie, X.L., Chung, S.L.: \(ERCN^*\) Merged nets for modeling degraded behavior and parallel processes in semiconductor manufacturing systems. IEEE Trans. Syst. Man. Cybern. Part A 34, 102–112 (2004)
Jiao, L., Cheung, T., Lu, W.: On liveness and boundedness of asymmetric choice nets. Theoret. Comput. Sci. 311, 165–197 (2004)
Kim, T.H., Chang, C.K., Mitra, S.: Design of service-oriented systems using SODA. IEEE Trans. Serv. Comput. 3, 236–249 (2010)
Kindler, E.: The ePNK: an extensible Petri net tool for PNML. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 318–327. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21834-7_18
Liu, G.J.: Some complexity results for the soundness problem of workflow nets. IEEE Trans. Serv. Comput. 7(2), 322–328 (2014)
Liu, G.J., Chen, L.: Deciding the liveness for a subclass of weighed Petri nets based on structurally circular wait. Int. J. Syst. Sci. 47, 1533–1542 (2016)
Liu, G.J., Jiang, C.J.: Co-NP-hardness of the soundness problem for asymmetric-choice workflow nets. IEEE Trans. Syst. Man Cybern. Syst. 45(8), 1201–1204 (2015)
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, 072103(16) (2015)
Liu, G.J., Jiang, C.J., Zhou, M.C., Xiong, P.C.: Interactive Petri nets. IEEE Trans. Syst. Man Cybern. Syst. 43(2), 291–302 (2013)
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)
Matshmoto, T., Tsuruta, Y.: Necessary and sufficient condition for liveness of asymmetric choice Petri nets. IEICE Trans. Fundam. E80-A, 521–533 (1997)
Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77, 541–580 (1989)
Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)
Acknowledgments
This paper was supported in part by the National Nature Science Foundation of China (Grant No. 61572360) and in part by the Shanghai Education Development Foundation and Shanghai Municipal Education Commission (Shuguang Program).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
He, L., Liu, G., Wang, M. (2016). A Sufficient and Necessary Condition to Decide Compatibility for Simple Circuit Inter-organization Workflow Nets. In: Wang, G., Han, Y., MartÃnez Pérez, G. (eds) Advances in Services Computing. APSCC 2016. Lecture Notes in Computer Science(), vol 10065. Springer, Cham. https://doi.org/10.1007/978-3-319-49178-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-49178-3_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49177-6
Online ISBN: 978-3-319-49178-3
eBook Packages: Computer ScienceComputer Science (R0)