Search

E-commerce business process nets (EBPNs) are a novel formal model for describing and validating e-commerce systems including interactive parties such as shopper, merchant, and third-party payment platform. Data errors and nondeterminacy of the data states during the trading process can be depicted with the help of EBPNs. However, the problem about how to analyze EBPNs remains largely open. To analyze their data-liveness, data-boundedness, and reachability, this paper presents two analysis methods. For EBPNs, reachability analysis is proposed based on a 3-D incidence matrix method. Additionally, reduction methods are proposed for a special EBPN. Finally, the validity and reliability of the proposed methods are illustrated via the examples of e-commerce systems. [ABSTRACT FROM PUBLISHER]

van der Aalst et al. proved that the soundness problem is solvable in polynomial time for free-choice workflow nets (FCWF-nets). However, FCWF-nets cannot model most web services composition and interorganizational business processes because the interaction among processes does not usually satisfy the free-choice requirement. Asymmetric-choice workflow nets (ACWF-nets) as a larger class than FCWF-nets can model lots of such cases. Our previous work showed that the (weak) soundness problem is co-NP-hard for three-bounded ACWF-nets. Later, Tiplea et al. proved that for three-bounded acyclic ACWF-nets, the weak soundness problem is co-NP-complete. We sharp these results in this paper. First, we prove that for ACWF-nets, whether they are one-bounded or k -bounded ( k~\boldsymbol > 1 ), the soundness problem is co-NP-hard. Second, it is proven that the soundness is equivalent to the weak soundness for any acyclic ACWF-nets, i.e., an acyclic ACWF-net is sound if and only if it is weakly sound. [ABSTRACT FROM AUTHOR]