2018
DOI: 10.1002/cpe.4699
|View full text |Cite
|
Sign up to set email alerts
|

A path detecting method to analyze the interactive compatibility of service processes based on WS‐BPEL

Abstract: Petri nets are frequently used formal tools to analyze the compatibility of interactive service processes described by Web Services Business Process Execution Language (WS-BPEL). However, the traditional methods based on Petri nets were with a high computable complexity for state space explosion. To resolve such problem, a logic Petri net-based path detecting method for compatibility analysis of interactive service processes is proposed. From the provided mapping rules, the service process described by WS-BPEL… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…is section briefly reviews some basic concepts, including traces [4], event logs [4], Petri nets [25][26][27][28][29][30][31], transition systems [13], and alignments [13].…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…is section briefly reviews some basic concepts, including traces [4], event logs [4], Petri nets [25][26][27][28][29][30][31], transition systems [13], and alignments [13].…”
Section: Preliminariesmentioning
confidence: 99%
“…OA_one[i] ⟵ c i ; (19) JUMP TO Step 1; //obtain the optimal alignment for the given trace and be ready to do the search for the next one; (20) ELSE (21) sucstate ⟵ π 3 (t j ); (22) sucalign ⟵ c i ; (23) succost ⟵ π 3 (curnode) + lc(π 2 (t j )); (24) sucnode ⟵ (sucstate,sucalign, succost); (25) queue ⟵ queue ∪ {sucnode}; //add the successor to the queue; (26) END IF (27) END IF (28) END IF (29) END FOR (30) END WHILE (31) END FOR (32) RETURN OA_one; ALGORITHM 2: Computing an optimal alignment between the event log and the process model based on the standard likelihood cost function.…”
Section: Remaining Unchangedmentioning
confidence: 99%
See 1 more Smart Citation
“…Similarly, t i ′ is labelled with a logic expression p 11∨ p 12 , and it means that p 13 can get a token once p 11 or p 12 has obtained the token. How to construct service nets for service processes can be found in our previous work [26].…”
Section: Definition 1 (Logic Petri Net [25])mentioning
confidence: 99%
“…obtain a place p in τ (t n ) and build service net SubSN j with SubSN j .i � p; (11) sp j � PathString_Generate (SubSN j ); (12) if (I (t n ) � O ∨ ) PS � PS + sp j + ||; (13) if (I (t n ) � O ∧ ) PS � PS + sp j + ⊗; (14) End for (15) Scientific Programming [28], service class [29], and service cluster [26,30]. Cloud services in above concepts are required with the same input and output parameters.…”
Section: Service Substitution Based On Clustering and Process Collabomentioning
confidence: 99%