[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

CoBTx-Net: A model for business collaboration reliability verification

  • Published:
Information Systems Frontiers Aims and scope Submit manuscript

Abstract

Collaborative business process can become unreliable when business partners collaborate in a peer- based fashion without central control. Therefore, reliability checking becomes an important issue that needs to be dealt with for any generic solution in managing business collaboration. In this paper, we propose a novel Choreographical Business Transaction Net (CoBTx-Net) to model collaborative business process and to manage the collaboration by individual participants. Furthermore three reliability properties named Time-embedded dead marking freeness, Inter-organizational dead marking freeness, and Collaborative soundness are defined based on CoBTx-Net to verify (1) the violation of time constraint, (2) collaborative logic conflicts, and (3) the improper termination from individual organizations.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Alonso, G., Casati, F., Kuno, H., & Machiraju, V. (2004). Web service: Concept, architectures and applications. Berlin: Springer.

    Google Scholar 

  • Arkin, A., Askary, S., Fordin, S., Jekeli, W., Kawaguchi, K., Orchard, D., et al. (2002). Web service choreography interface (WSCI) 1.0. http://www.w3.org/TR/wsci/.

  • Chi, Y., Tsai, M., & Lee, C. (2005). A Petri-net based validator in reliability of a composite service. In The proceeding of the IEEE international conference on e-technology, e-commerce and e-service (pp. 450–453).

  • Dubray, J. J. (2002). A new model for ebXML BPSS multi-party collaborations and web services choreography. http://www.ebpml.org/ebpml.doc.

  • Girault, C., & Valk, R. (2003). Petri nets for system engeneering: A guide to modeling, verification and application. Berlin: Springer.

    Google Scholar 

  • Gray, J., & Reuter, A. (1993). Transaction processing: Concepts and techniques. San Francisco: Morgan Kaufmann.

    Google Scholar 

  • Haugen, B. (2002). Multi-party electronic business transactions (2002). http://www.supplychainlinks.com/MultiPartyBusinessTransactions.PDF.

  • Henderson-Sellers, B. (2001). Some problems with the UML v1.3 metamodel. In The proceedings of the 34th annual Hawaii international conference on systems sciences.

  • Hinz, S., Schmidt, K., & Stahl, C. (2005). Transforming BPEL to Petri Nets. In International conference on business process management.

  • Huber, P., Jensen, K., & Shapiro., R. M. (1990). Hierarchies in colored Petri nets. In The proceeding of the advances in Petri nets (pp. 313–341). Berlin: Springer.

    Google Scholar 

  • ISO/IEC, 14462. (1997). Information technologies open EDI reference model.

  • Iwasa, K. (2004). Web services reliable messaging 1.1 (WS-Reliability). http://docs.oasis-open.org/wsrm/ws-reliability/v1.1.

  • Jordan, D., Evdemon, J., Alves, A., Arkin, A., Askary, S., Barreto, C., et al. (2006). Business process execution language for web service (BPEL4WS) 2.0. http://docs.oasis-open.org/wsbpel/2.0/.

  • Murata, T. (1989). Petri nets: Properties, analysis and application. Proceedings of the IEEE, 77(4), 541–580.

    Article  Google Scholar 

  • Newcomer, E., & Lomow, G. (2005). Understanding SOA with web service. Harlow: Pearson Education.

    Google Scholar 

  • Newcomer, E., Robinson, I., Feingold, M., & Jeyaraman, R. (2006a). Web services coordination 1.1 (WS-coordination). http://docs.oasis-open.org/ws-tx/wstx-wscoor-1.1-spec-pr-01.pdf.

  • Newcomer, E., Robinson, I., Little, M., & Wilkinson, A. (2006b). Web services atomic transaction (WS-atomic transaction). http://docs.oasis-open.org/ws-tx/wstx-wsat-1.1-spec-pr-01.pdf.

  • Newcomer, E., Robinson, I., Freund, T., Green, A., Harby, J., & Little, M. (2006c). Web services business activity (WS-business activity). http://docs.oasis-open.org/ws-tx/wstx-wsba-1.1-spec-pr-01.pdf.

  • Petri, C. A. (1962). Kommunikation mit automaten. Thesis (PhD). Institute instrumentelle Mathematik.

  • SAP (2002). mysap.com collaborative business scenarios, whitepaper. In: Walldorf.

  • Song, Y., & Lee, J. (2002). Deadlock analysis of Petri nets using the transitive matrix. In Proceedings of SICE (pp. 689–694).

  • Stork, D. G., & van Glabbeek, R. J. (2002). Token-controlled place refinement in hierarchical Petri nets with application active document workflow. In The proceedings of the 23th international conference on application and theory in Petri nets (pp. 394–413).

  • Steen, M., Lankhorst, M., & Van de Wetering, R. (2002). Modelling networked enterprises. In The proceedings of the 6th international enterprise distributed object computing conference.

  • Sun, H., & Yang, J. (2007). BTx-Net: A token based dynamic model for supporting consistent collaborative business transactions. In The proceedings of the IEEE international conference on service computing (pp. 490–497). Salt Lake City, 9-13 July.

  • Uncefact, & OASIS. (2001). ebXML business process specification schema v1.01.

  • Van der Aalst, W. (1997). Verification of workflow nets. In The proceedings of the 18th international conference on application and theory in Petri nets (pp. 407–426).

  • Van der Aalst, W. (1998). The application of Petri nets to workflow management. The Journal of Circuits, Systems and Computers, 8(1), 21–66.

    Article  Google Scholar 

  • Van der Aalst, W., Ter Hofstede, A., Kiepuszewski, B., & Barros, A. (2003). Workflow patterns. Distributed and Parallel Databases, 14, 5–51.

    Article  Google Scholar 

  • Webber, D. (2004). The benefits of ebXML for E-business. In The proceedings of the international conference on XML.

  • Yang, Y., Tan, Q., Yu, J., & Liu., F. (2005). Transformation BPEL to CP-Nets for verifying web service composition. In The proceedings of the international conference on next generation web services practices.

  • Yang, Y., Tan, Q., Xiao, Y., Yu, J., & Liu., F. (2006) Exploiting hirachichical CP-nets to increase the reliability of web services workflow. In The proceedings of the symposium on application and the internet.

  • Yi, X., & Kochut, K. J. (2004). A CP-nets-based design and verification framework for web services composition. In The proceedings of the IEEE international conference on web services.

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, Sydney, New South Wales, 2109, Australia

    Haiyang Sun & Jian Yang

  2. CSIRO ICT Centre, Hobart, Tasmania, 7001, Australia

    Lai Xu

Authors
  1. Haiyang Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lai Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian Yang.

Appendix

Appendix

Theorem 1

A CoBTx-Net is time-embedded dead marking free iff

$$ \exists t_h\in T^{CoN},\ P_j^{r_{t_h}}(time)=\sum\limits_{i=1}^m \frac{r_{t_h}}{d_{t_h}} c_i\geq 1 $$

where \(M^{\ast t}_k(time)\!=\!M_{k-1}\!\cdot\! L_{BP}^{\ast t},\ M^{\ast t}_k(time_j)\!=\!P_j(time)\!=\sum_{h=1}^n p_{j}^{r_{t_h}}(time).\)

Proof

If a CoBTx-Net is time-embedded dead marking free, then within specified time there exists transition t h to be executed. Therefore, the time constraint is not violated so that the transition can be fired. Obviously, there exists \(r_{t_h}=1\) and q pre-places in M k − 1 as c i  ≥ 1 to accumulate enough tokens to activate the transition t h firing(d ≤ q ≤ m). Hence \(P_j^{r_{t_h}}(time)\geq 1\). If there exists \(P_j^{r_{t_h}}(time)=\sum_{i=1}^m \frac{r_{t_h}}{d}c_i\geq 1\), then \(r_{t_h}\)=1 and q (d ≤ q ≤ m) pre-places as c i are non-zero. It means that at specific time, there exists a transition t h to be fired by tokens in pre-places c i without violation on time constraint to finally deposit tokens in post-place p j . Hence, the net is time-embedded dead marking free. □

Theorem 3

The solution for \(\left[\bigtriangleup M^{AO}, \bigtriangleup M^{MO}\right]=\) \(A^T\! \sum_{j=1}^{n}\left[\!u_j^{AO}\!, u_j^{MO}\!\right]\) exists and is qualified iff \(B_{\!f}\big[\!\!\bigtriangleup\!\! M^{AO}\!,\bigtriangleup M^{MO}\big]=0\) and the fire of a transition in the solution to transfer an AO-Token must transfer a specified MO-Token together, where: \(B_{\!f}=\big[ I_u:-A_{11}^T\big(A_{12}^T\big)^{-1}\big]\) , and r is the rank of incident matrix A and partitions A as:

$$ A=\left[\begin{array}{ll} A_{11}^{r \times m-r} & A_{12}^{r \times r}\\[7pt] A_{21}^{n-r \times m-r} & A_{22}^{n-r \times r}\\ \end{array} \right] $$

Proof

Firstly, we transform the equation into two equivalent linea equations as:

$$ \left\{\begin{array}{l} \bigtriangleup M^{AO}=A^T \sum_{j=1}^{n}u_j^{AO} \\[8pt] \bigtriangleup M^{MO}=A^T \sum_{j=1}^{n} u_j^{MO} \end{array}\right. $$

According to theorem in Murata (1989), if \(B_f\big[\bigtriangleup M^{AO},\bigtriangleup M^{MO}\big]=0\), then there exists solutions for the combined equation. Since AO-Token will move with MO-Token, the qualified solutions for the equation will satisfy the condition that, if the transition \(u_j^{AO}(x)\neq\emptyset\) (transferring an AO-Token), then it must also transfer a MO-Token together as \(u_j^{MO}(x)\neq\emptyset\). □

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, H., Yang, J. & Xu, L. CoBTx-Net: A model for business collaboration reliability verification. Inf Syst Front 11, 257–272 (2009). https://doi.org/10.1007/s10796-008-9088-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10796-008-9088-1

Keywords

Search

Navigation