1. Thesis Report: Composition and Evaluation of Trustworthy Web Services James S.F. Hsieh, nomad_libral@gmail.com SOA Team, KS Lib, Graduate Institute of Network Learning Technology , National Central University , Taiwan

6. Our Proposed Architecture (1/2) Based on CMU Framework Evaluate trust of a signal web service. Evaluate trust of a composite web servi ce.

7. Our Proposed Architecture (2/2)

10. Specifications of Trustworthy Experience (2/3) An example of the trustworthy aspect ontology

11. Specifications of Trustworthy Experience (2/3) Description of an experience instance for bookstore service 2 Days 3 Hours False $ 53.5 Book delivery time Damage Price Bookstore True True RSA technology DES technology Security 510 ms 2100 ms 1.5 % Response time Turnaround time Packet miss rate Network performance True Reach Functional Value Property Aspect

12. Trustworthy Requirement M atching Trustworthy requirements are kind of rule based policies that I can utilize to determine whether described trustworthy experiences are acceptable and meet service requester’s trustworthy requirement. Trustworthy requirements are similar to sentences appeared in propositional logic. 0

17. Trustworthy Web Service Evaluation Petri Net (2/3) A control flow of a general composite service can be organized by the following control patterns .

18. Trustworthy Web Service Evaluation Petri Net (3/3) For Example: OWL-S Each edge has a Confidence value in a Coverability Graph. The Coverability Graph is a special case of the Markov Process. <process:CompositeProcess rdf:ID=&quot;CompositionService&quot;> <process:composedOf> <process:If-Then-Else> <process:ifCondition>…</process:ifCondition> <process:then>… <process:AtomicProcess rdf:about=&quot;#Ser1&quot;/> </process:then> <process:else>… <process:SplitJoin>… <process:AtomicProcess rdf:about=&quot;#Ser2&quot;/> <process:Repeat-Until> <process:untilCondition>…</process:untilCondition> <process:untilProcess>… <process:AtomicProcess rdf:about=&quot;# Ser3&quot;/> </process:untilProcess> </process:Repeat-Until> </process:SplitJoin> </process:else> </process:If-Then-Else> </process:composedOf> </process:CompositeProcess>

21. Evaluation Algorithm Case 1 [M initial , M 1 , M 2 , M 34 , M 34 ’, M 5 , M 67 , M 67 ’, M final ] Composition Confidence = min{a, b × c δ } Step 1 [1, 1, 1, 1, 1, 1, 1, 1, a] 1 Step 2 [1, 1, 1, 1, 1, 1, 1, 1, a] 2 3 Step 3 [1, 1, b, 1, 1, 1, 1, 1, a] 4 Step 4 [1, 1, b, b, 1, 1, 1, 1, a] 5 Step 5 [1, 1, b, b, 1, 1, c δ , 1, a] 6 Step 6 [1, 1, b, b, b ×c δ , 1, c δ , 1, a] 7 Step 7 [1, 1, b, b, b ×c δ , 1, b×c δ , 1, a] 8 Step 8 [1, 1, b, b, b ×c δ , 1, b×c δ , 1, a] 9 Step 9 [1, 1, b, b, b ×c δ , 1, b×c δ , 1, min{a, b×c δ }]

23. The End Thanks James S.F. Hsieh, nomad_libral@gmail.com SOA Team, KS Lib, Graduate Institute of Network Learning Technology , National Central University , Taiwan