Fine-grained Compatibility and Replaceability Analysis of Timed Web - PowerPoint PPT Presentation

Fine-grained Compatibility and Replaceability Analysis of Timed Web Service Protocols Julien Ponge 1 , 2 , Boualem Benatallah 2 , Fabio Casati 3 and Farouk Toumani 1 (1) Universit´ e Blaise Pascal, Clermont-Ferrand, France (2) UNSW, Sydney, Australia (3) University of Trento, Italy ER 2007, Auckland, New Zealand Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 1 / 31

Outline Introduction 1 Timed protocols 2 Formal framework 3 Implementation and conclusion 4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 2 / 31

Outline Introduction 1 Timed protocols 2 Formal framework 3 Implementation and conclusion 4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 3 / 31

WS for application integration My company Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

WS for application integration My company RPC, MOM, ESB, ... Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

WS for application integration My company Integrated applications and clients RPC, MOM, ESB, ... Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

WS for application integration Partner 1 HTML My company Integrated applications and clients RPC, MOM, ESB, ... Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

WS for application integration Partner 1 Partner 2 VPN + HTML adapters My company Integrated applications and clients RPC, MOM, ESB, ... Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

WS for application integration Partner 1 Partner 2 XML, SOAP, HTTP, ... My company Web services Integrated applications and clients RPC, MOM, ESB, ... Databases, new and legacy applications Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 4 / 31

Static vs dynamic interface Operations, message schemas, binding, ... WSDL answer AnswerMessage login LoginMessage search SearchMessage Web service Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 5 / 31

Static vs dynamic interface Operations, message schemas, binding, ... WSDL answer AnswerMessage login LoginMessage search SearchMessage Valid conversations: Web service login, search, answer login, search, answer, search, answer (...) Invalid conversations: search, login, answer answer, search, login (...) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 5 / 31

Business Protocols [ER 2004, DKE: Benatallah, Casati, Toumani] Conversations: message choreographies Finite deterministic automata Execution traces semantics search  login  search  answer − start logged searching answered Extensions: transactions, timing constraints, policies, ... Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 6 / 31

Compatibility analysis Service ? Requester / service Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 7 / 31

Replaceability analysis Service 1 Requester Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 8 / 31

Replaceability analysis Service 1 Service 2 ? Requester Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 8 / 31

Use-case: agile composition runtimes Development environment Runtime environment Composite application Compatibility Replaceability Services with protocol descriptions Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 9 / 31

A need for timing constraints Many examples: TCP/IP, watchdogs transaction locks business agreements BPEL ( wait / onAlarm ) RosettaNet ... Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 10 / 31

Outline of contributions 1 Extension of business protocols 2 Compatibility and replaceability analysis 3 A new class of timed automata 4 Implementation Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 11 / 31

Outline Introduction 1 Timed protocols 2 Formal framework 3 Implementation and conclusion 4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 12 / 31

Primitives C-Invoke Temporal windows for a message exchange M-Invoke Expiration for an implicit state change C-Invoke (( T 1 < 12h:50m ) ∧ ( T 2 > 1h )) M-Invoke (( T 1 = 6h ) ∧ ( T 2 > 1h )) ( · · · ) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 13 / 31

Primitives C-Invoke Temporal windows for a message exchange M-Invoke Expiration for an implicit state change C-Invoke (( T 1 < 12h:50m ) ∧ ( T 2 > 1h )) M-Invoke (( T 1 = 6h ) ∧ ( T 2 > 1h )) ( · · · ) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 13 / 31

Extensions s5 T6 :loanOffer − T7 :loanAccept  s6 s7 C − Invoke  T6  11d  T7 :offerExpired s8 M − Invoke  T6 = 30d  Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 14 / 31

Analysis classes Compatibility: ◮ full ◮ partial Replaceability: ◮ full ◮ partial ◮ subsumption, equivalence ◮ w.r.t. client protocol ◮ w.r.t. interaction role A set of flexible classes because of a versatile environment Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 15 / 31

Illustration of replaceability w.r.t. client protocol T2: b − T1: a  s0 s1 s2 T3: c − T4 :d  T5 :e  s3 s4 P Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31

Illustration of replaceability w.r.t. client protocol T2: b − T1: a  s0 s1 s2 T3: c − T4 :d  s3 s4 C − Invoke  T1  4h  P' Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31

Illustration of replaceability w.r.t. client protocol T2: b − T1: a  s0 s1 s2 T3: c − T4 :d  T5 :e  s3 s4 C − Invoke  T1  4h  P' Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31

Illustration of replaceability w.r.t. client protocol T2: b − T1: a  s0 s1 s2 T3: c − T4 :d  T5 :e  s3 s4 P Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31

Illustration of replaceability w.r.t. client protocol T2: b − T1: a  s0 s1 s2 T3: c − T4 :d  s3 s4 C − Invoke  T1  4h  P' Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31

Characterization through operators Comparison subsumption ( ⊑ ), equivalence ( ≡ ) Manipulation parallel composition ( � TC ), intersection ( � TI ), difference ( � TD ) Example: P 1 can replace P 2 w.r.t. a client protocol P C iff: P C � TC P 2 � � P 2 ⊑ P 1 , or P C � TC ( P 2 � TD P 1 ) = ∅ Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 17 / 31

Characterization through operators Comparison subsumption ( ⊑ ), equivalence ( ≡ ) Manipulation parallel composition ( � TC ), intersection ( � TI ), difference ( � TD ) Example: P 1 can replace P 2 w.r.t. a client protocol P C iff: P C � TC P 2 � � P 2 ⊑ P 1 , or P C � TC ( P 2 � TD P 1 ) = ∅ Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 17 / 31

1 Algorithms and decidability? 2 Are timed protocols closed under our operators?

Outline Introduction 1 Timed protocols 2 Formal framework 3 Implementation and conclusion 4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 19 / 31

Timed automata (Alur, Dill 1994) Clocks over dense time + constraints + resets Vibrant research Use-cases: { system, property } − → checker − → { yes , no } a b s2 s0 s1 x : = 0 x  5 “Timed words such that a follows b by at most 5 units of time” Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 20 / 31

Mapping Protocol TA Timed protocols Timed automata + extensions Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31

Mapping Timed protocol M − Invoke  T 2 = 10h  S4 T 2 :b  T 1 : a − T 4 :  S0 S1 S2 T 3 :c  C − Invoke  T 1  5h  S3 Timed automaton x 2 = 10  S4 a − x 3 : = 0 b  S0 S1 S2 c  x 1 : = 0 x 1  5 S3 x 2  10 x 4 : = 0 x 2 : = 0 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31