2009 International Conference on E-Business and Information System Security 2009
DOI: 10.1109/ebiss.2009.5137943
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Service Composition Verification Based on Pi-Calculus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…GIS service chain also is a system which structure may be change. The advantages of Pi-Calculus are very suitable for GIS service chain formal verification, so in this paper Pi-Calculus is chose to describe and verify the service chain model [7]- [9] .…”
Section: Pi-calculus and Gis Service Chain Formal Methodsmentioning
confidence: 99%
“…GIS service chain also is a system which structure may be change. The advantages of Pi-Calculus are very suitable for GIS service chain formal verification, so in this paper Pi-Calculus is chose to describe and verify the service chain model [7]- [9] .…”
Section: Pi-calculus and Gis Service Chain Formal Methodsmentioning
confidence: 99%
“…Readers interested in this algorithm can refer to [12]. Set parListC = parListB ∪ parListD, where | parListC |= |parListA| and (5) foreach(par1 in parListD) (6) {foreach(par2 in parListA) (7) {SimilarityTT(par1,par2)=0;}} (8) Return MAP' through Hungarian algorithm parListA and parListC;} (9)Else{Set parListC = parListA ∪ parListD, where | parListC |= |parListB| and (10) foreach(par1 in parListD) (11) {foreach(par2 in parListB) (12) {SimilarityTT(par1,par2)=0;}} (13) Return MAP'' through Hungarian algorithm on parListC and parListB;} Algorithm ExtendAssignmentAlgorithm is used to find the best mapping between two set of parameters. From line 1 to line 2, algorithm judges if the number of parameters in parameter set is equal, if so, return mapping function through invoking Hungarian algorithm.…”
Section: Web Service Discovery Based On Assignment Algorithmmentioning
confidence: 99%
“…However, the performance of current semantic service discovery method remains to be improved. Based on our former research works [7][8][9][10], this paper proposes an improved web service discovery method based on assignment algorithm, which can convert service discovery problem into assignment problem. A serial experiments illustrate the proposed method can improve precision and recall rate of service discovery.…”
Section: Introductionmentioning
confidence: 99%