Fine-grained Compatibility and Replaceability Analysis of Timed Web Service Protocols
|
|
- Marcus Charles
- 6 years ago
- Views:
Transcription
1 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é 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
2 Outline 1 Introduction 2 Timed protocols 3 Formal framework 4 Implementation and conclusion Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 2 / 31
3 Outline 1 Introduction 2 Timed protocols 3 Formal framework 4 Implementation and conclusion Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 3 / 31
4 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
5 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
6 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
7 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
8 WS for application integration Partner 1 Partner 2 HTML VPN + 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
9 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
10 Static vs dynamic interface Operations, message schemas, binding,... WSDL answer login search AnswerMessage LoginMessage SearchMessage Web service Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 5 / 31
11 Static vs dynamic interface Operations, message schemas, binding,... WSDL answer login search AnswerMessage LoginMessage SearchMessage Web service Valid conversations: 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
12 Business Protocols [ER 2004, DKE: Benatallah, Casati, Toumani] Conversations: message choreographies Finite deterministic automata Execution traces semantics search start login logged search searching answer answered Extensions: transactions, timing constraints, policies,... Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 6 / 31
13 Compatibility analysis Service? Requester / service Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 7 / 31
14 Replaceability analysis Service 1 Requester Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 8 / 31
15 Replaceability analysis Service 1 Service 2? Requester Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 8 / 31
16 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
17 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
18 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
19 Outline 1 Introduction 2 Timed protocols 3 Formal framework 4 Implementation and conclusion Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 12 / 31
20 Primitives C-Invoke M-Invoke Temporal windows for a message exchange 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
21 Primitives C-Invoke M-Invoke Temporal windows for a message exchange 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
22 Extensions s5 T6 :loanoffer s6 T7 :loanaccept C Invoke T6 11d s7 T7 :offerexpired M Invoke T6=30d s8 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 14 / 31
23 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
24 Illustration of replaceability w.r.t. client protocol T1: a T2: b s0 s1 s2 T3: c P T5 :e s3 T4 :d s4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31
25 Illustration of replaceability w.r.t. client protocol T1: a T2: b s0 s1 s2 T3: c P' s3 T4 :d C Invoke T1 4h s4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31
26 Illustration of replaceability w.r.t. client protocol T1: a T2: b s0 s1 s2 T3: c P' T5 :e s3 T4 :d C Invoke T1 4h s4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31
27 Illustration of replaceability w.r.t. client protocol T1: a T2: b s0 s1 s2 T3: c P T5 :e s3 T4 :d s4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31
28 Illustration of replaceability w.r.t. client protocol T1: a T2: b s0 s1 s2 T3: c P' s3 T4 :d C Invoke T1 4h s4 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 16 / 31
29 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: [ PC 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
30 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: [ PC 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
31 1 Algorithms and decidability? 2 Are timed protocols closed under our operators?
32 Outline 1 Introduction 2 Timed protocols 3 Formal framework 4 Implementation and conclusion Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 19 / 31
33 Timed automata (Alur, Dill 1994) Clocks over dense time + constraints + resets Vibrant research Use-cases: {system, property} checker {yes, no} s0 a x :=0 s1 b x 5 s2 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
34 Mapping Protocol TA Timed protocols Timed automata + extensions Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31
35 Mapping Timed protocol T 1 : a T 2 :b S0 S1 S2 Timed automaton C Invoke T 1 5h S0 a b S1 x 1 :=0 x 1 5 S2 x 2 :=0 M Invoke T 2 =10h c x 2 10 T 4 : T 3 : c x 2 =10 x 3 :=0 x 4 :=0 S4 S3 S4 S3 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31
36 Mapping Timed protocol T 1 : a T 2 :b S0 S1 S2 Timed automaton C Invoke T 1 5h S0 a b S1 x 1 :=0 x 1 5 S2 x 2 :=0 M Invoke T 2 =10h c x 2 10 T 4 : T 3 : c x 2 =10 x 3 :=0 x 4 :=0 S4 S3 S4 S3 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31
37 Mapping Timed protocol T 1 : a T 2 :b S0 S1 S2 Timed automaton C Invoke T 1 5h S0 a b S1 x 1 :=0 x 1 5 S2 x 2 :=0 M Invoke T 2 =10h c x 2 10 T 4 : T 3 : c x 2 =10 x 3 :=0 x 4 :=0 S4 S3 S4 S3 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 21 / 31
38 The case of ε-transitions They have clock resets and they cannot be removed! Proof Based on precise actions (Bérard, Diekert, Gastin, Petit 99) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 22 / 31
39 The case of ε-transitions T 1 : a x T1 =1 x 1 0 x 1 =1 x 2 0 x 2 =1 x 1 1 s0 T 2 :b, 0 x T1 1 1, x T1 =1 s1 T 3 : b 0 x 1 1 x T 1 1 2, x T 3 =1 s2 (b, δ 1 ) (b, δ 2 ) (b, δ d 1 ) (a, d) (a, d + 1) the occurrences of a-events should be precise Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 22 / 31
40 The case of intersection / composition Usual technique Product with label synchronization s1 a(+) s2 s1' a(+) s2' b(+) s3 c(+) s3' s1,s1' ti a(+) s2,s2' Determinism problem: ε-transitions are never synchronized! Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 23 / 31
41 The case of intersection / composition s1 a(+) x 1 =k 1 1 s2 s3 ti s1' a(+) x 2 =k 2 2 s2' s3' s1,s1' a(+) x 1 =k 1 1 x 2 =k 2 2 s2,s2' s3,s1' x 2 =k 2 2 x 1 =k 1 1 x 2 =k 2 2 x 1 =k 1 1 x 2 =k 2 2 Keeps semantics and determinism! (mandatory (x i = k i ) clauses in M-Invoke ) s1,s3' s3,s3' x 1 =k 1 1 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 23 / 31
42 The case of difference / complementation Extension of the procedure on deterministic TA a, s0 1 b, s1 2 s2 Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 24 / 31
43 The case of difference / complementation Extension of the procedure on deterministic TA a, s0 1 b, s1 2 s2 a a, 1 b q b, 2 a,b Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 24 / 31
44 The case of difference / complementation Extension of the procedure on deterministic TA s0 a, 1 b, s1 2 a s2 a, 1 b q b, 2 a,b Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 24 / 31
45 The case of difference / complementation Needs exactly 1 run per recognized timed word! a, s0 1 b, s1 2 s2 (a,0) (b,3) b, 2? s3 The extended complementation procedure keeps this property Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 24 / 31
46 The case of subsumption / equivalence The test P 1 P 2 is equivalent to P 1 P 2 = (timed language inclusion problem) Complementation PTA are closed under complementation Emptiness checking (Alur, Dill 94) The problem is PSPACE-complete and need a model-checker (UPPAAL, Kronos,...) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 25 / 31
47 The case of subsumption / equivalence The test P 1 P 2 is equivalent to P 1 P 2 = (timed language inclusion problem) Complementation PTA are closed under complementation Emptiness checking (Alur, Dill 94) The problem is PSPACE-complete and need a model-checker (UPPAAL, Kronos,...) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 25 / 31
48 Results 1 Timed protocols are closed under manipulation operators 2 Timed automata based algorithms for manipulation and comparison operators 3 Every compatibility and replaceability class can be implemented 4 Protocol timed automata form a new class of timed automata Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 26 / 31
49 Outline 1 Introduction 2 Timed protocols 3 Formal framework 4 Implementation and conclusion Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 27 / 31
50 Prototype Eclipse-based Protocol editor Protocol operators Complementary modules: Protocol extraction from BPEL Protocol mining from execution logs (lead by Hamid Motahari) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 28 / 31
51
52 Perspectives Refined expressiveness (in progress) Agile composition development and execution runtimes Analyse at the composition level Help BPEL engines scalability (with O. Coupelon) Ponge et al. (UBP, UNSW, U.Trento) Analysis of Timed Protocols ER 2007, Auckland 30 / 31
53 Questions? ponge/
Analysis and Applications of Timed Service Protocols
Analysis and Applications of Timed Service Protocols Julien Ponge, Benatallah Boualem, Fabio Casati, Farouk Toumani To cite this version: Julien Ponge, Benatallah Boualem, Fabio Casati, Farouk Toumani.
More informationTimed Automata From Theory to Implementation
Timed Automata From Theory to Implementation Patricia Bouyer LSV CNRS & ENS de Cachan France Chennai january 2003 Timed Automata From Theory to Implementation p.1 Roadmap Timed automata, decidability issues
More informationSemantic Web. Semantic Web Services. Morteza Amini. Sharif University of Technology Spring 90-91
بسمه تعالی Semantic Web Semantic Web Services Morteza Amini Sharif University of Technology Spring 90-91 Outline Semantic Web Services Basics Challenges in Web Services Semantics in Web Services Web Service
More informationTimed Automata: Semantics, Algorithms and Tools
Timed Automata: Semantics, Algorithms and Tools Johan Bengtsson and Wang Yi Uppsala University Email: {johanb,yi}@it.uu.se Abstract. This chapter is to provide a tutorial and pointers to results and related
More informationCOMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University
Eugene Syriani Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science McGill University 1 OVERVIEW In the context In Theory: Timed Automata The language: Definitions and Semantics
More informationMarcoFlow: Modeling, Deploying, and Running Distributed User Interface Orchestrations
MarcoFlow: Modeling, Deploying, and Running Distributed User Interface Orchestrations Florian Daniel, Stefano Soi, Stefano Tranquillini, Fabio Casati University of Trento, Povo (TN), Italy {daniel,soi,tranquillini,casati}@disi.unitn.it
More informationConceptual Modeling of Web Service Conversations
Conceptual Modeling of Web Service Conversations Boualem Benatallah 1, Fabio Casasti, Farouk Toumani 2, Rachid Hamadi 1 Intelligent Enterprise Technologies Laboratory HP Laboratories Palo Alto HPL-2003-60
More informationSemantic Web. Semantic Web Services. Morteza Amini. Sharif University of Technology Fall 94-95
ه عا ی Semantic Web Semantic Web Services Morteza Amini Sharif University of Technology Fall 94-95 Outline Semantic Web Services Basics Challenges in Web Services Semantics in Web Services Web Service
More informationLesson 5 Web Service Interface Definition (Part II)
Lesson 5 Web Service Interface Definition (Part II) Service Oriented Architectures Security Module 1 - Basic technologies Unit 3 WSDL Ernesto Damiani Università di Milano Controlling the style (1) The
More informationModeling Interactions of Web Software
Modeling Interactions of Web Software Tevfik Bultan Department of Computer Science University of California Santa Barbara, CA 9106 bultan@cs.ucsb.edu Abstract Modeling interactions among software components
More informationFormal Modeling of BPEL Workflows Including Fault and Compensation Handling
Formal Modeling of BPEL Workflows Including Fault and Compensation Handling Máté Kovács, Dániel Varró, László Gönczy kovmate@mit.bme.hu Budapest University of Technology and Economics Dept. of Measurement
More informationAnalyzing Conversations of Web Services
Analyzing Conversations of Web Services Tevfik Bultan 1 Xiang Fu 2 Jianwen Su 1 1 Department of Computer Science, University of California, Santa Barbara Santa Barbara, CA 91306, USA. {bultan, su}@cs.ucsb.edu.
More informationTimed Automata. Rajeev Alur. University of Pennsylvania
Timed Automata Rajeev Alur University of Pennsylvania www.cis.upenn.edu/~alur/ SFM-RT, Bertinoro, Sept 2004 model temporal property Model Checker yes error-trace Advantages Automated formal verification,
More informationM. De Wulf, L. Doyen,J.-F. Raskin Université Libre de Bruxelles Centre Fédéré en Vérification
Systematic Implementation of Real-Time Models M. De Wulf, L. Doyen,J.-F. Raskin Université Libre de Bruxelles Centre Fédéré en Vérification Model-based Development for Controllers Make a model of the environment
More informationRegular Languages and Regular Expressions
Regular Languages and Regular Expressions According to our definition, a language is regular if there exists a finite state automaton that accepts it. Therefore every regular language can be described
More informationRESTful Web Service Composition with JOpera
RESTful Web Service Composition with JOpera Cesare Pautasso Faculty of Informatics University of Lugano (USI), Switzerland http://www.pautasso.info 1 University of Lugano, Switzerland Faculty of Informatics
More informationSoftware Testing IV. Prof. Dr. Holger Schlingloff. Humboldt-Universität zu Berlin
Software Testing IV Prof. Dr. Holger Schlingloff Humboldt-Universität zu Berlin and Fraunhofer Institute of Computer Architecture and Software Technology FIRST Outline of this Lecture Series 2006/11/24:
More informationModelling and verification of BPEL business processes
Modelling and verification of BPEL business processes Marina Mongiello Dipartimento di Elettronica ed Elettrotecnica Politecnico di Bari, Italy mongiello@poliba.it Daniela Castelluccia Dipartimento di
More informationLesson 3 SOAP message structure
Lesson 3 SOAP message structure Service Oriented Architectures Security Module 1 - Basic technologies Unit 2 SOAP Ernesto Damiani Università di Milano SOAP structure (1) SOAP message = SOAP envelope Envelope
More informationLesson 11 Programming language
Lesson 11 Programming language Service Oriented Architectures Module 1 - Basic technologies Unit 5 BPEL Ernesto Damiani Università di Milano Variables Used to store, reformat and transform messages Required
More informationWeb Services Architecture Directions. Rod Smith, Donald F Ferguson, Sanjiva Weerawarana IBM Corporation
Web Services Architecture Directions Rod Smith, Donald F Ferguson, Sanjiva Weerawarana 1 Overview Today s Realities Web Services Architecture Elements Web Services Framework Conclusions & Discussion 2
More informationOverview of Timed Automata and UPPAAL
Overview of Timed Automata and UPPAAL Table of Contents Timed Automata Introduction Example The Query Language UPPAAL Introduction Example Editor Simulator Verifier Conclusions 2 Introduction to Timed
More informationCSE450. Translation of Programming Languages. Automata, Simple Language Design Principles
CSE45 Translation of Programming Languages Automata, Simple Language Design Principles Finite Automata State Graphs A state: The start state: An accepting state: A transition: a A Simple Example A finite
More informationLecture 2. Decidability and Verification
Lecture 2. Decidability and Verification model temporal property Model Checker yes error-trace Advantages Automated formal verification, Effective debugging tool Moderate industrial success In-house groups:
More information1. (10 points) Draw the state diagram of the DFA that recognizes the language over Σ = {0, 1}
CSE 5 Homework 2 Due: Monday October 6, 27 Instructions Upload a single file to Gradescope for each group. should be on each page of the submission. All group members names and PIDs Your assignments in
More informationCSE450. Translation of Programming Languages. Lecture 20: Automata and Regular Expressions
CSE45 Translation of Programming Languages Lecture 2: Automata and Regular Expressions Finite Automata Regular Expression = Specification Finite Automata = Implementation A finite automaton consists of:
More informationmanagement in Web Service Technologies
Conversational state management in Web Service Technologies Homework for Seminars in Software Engineering Author: Claudio Di Ciccio (dc.claudio@gmail.com) Conversational state management in Web Service
More informationWeb Services Development for IBM WebSphere Application Server V7.0
000-371 Web Services Development for IBM WebSphere Application Server V7.0 Version 3.1 QUESTION NO: 1 Refer to the message in the exhibit. Replace the??? in the message with the appropriate namespace.
More informationNested Words. A model of linear and hierarchical structure in data. Examples of such data
Nested Words A model of linear and hierarchical structure in data. s o m e w o r d Examples of such data Executions of procedural programs Marked-up languages such as XML Annotated linguistic data Example:
More informationWorkshop on Web of Services for Enterprise Computing
Workshop on Web of Services for Enterprise Computing Fujitsu Submission v0.2 Authors: Jacques Durand Tom Rutt Hamid BenMalek Acknowledgements: Masahiko Narita Paul A. Knapp 1. The Great Divide The fundamental
More informationA Test Case Generation Algorithm for Real-Time Systems
A Test Case Generation Algorithm for Real-Time Systems Anders Hessel and Paul Pettersson Department of Information Technology Uppsala University, P.O. Box 337 SE-751 05 Uppsala, Sweden {hessel,paupet}@it.uu.se
More informationBPEL Research. Tuomas Piispanen Comarch
BPEL Research Tuomas Piispanen 8.8.2006 Comarch Presentation Outline SOA and Web Services Web Services Composition BPEL as WS Composition Language Best BPEL products and demo What is a service? A unit
More informationDeveloping BPEL Processes Using WSO2 Carbon Studio. Waruna Milinda
+ Developing BPEL Processes Using WSO2 Carbon Studio Waruna Ranasinghe(waruna@wso2.com) Milinda Pathirage(milinda@wso2.com) + WSO2 Founded in 2005 by acknowledged leaders in XML, Web Services Technologies
More informationLexical Analysis - 2
Lexical Analysis - 2 More regular expressions Finite Automata NFAs and DFAs Scanners JLex - a scanner generator 1 Regular Expressions in JLex Symbol - Meaning. Matches a single character (not newline)
More informationBEAAquaLogic. Service Bus. JPD Transport User Guide
BEAAquaLogic Service Bus JPD Transport User Guide Version: 3.0 Revised: March 2008 Contents Using the JPD Transport WLI Business Process......................................................2 Key Features.............................................................2
More informationSpecification and Analysis of Real-Time Systems Using Real-Time Maude
Specification and Analysis of Real-Time Systems Using Real-Time Maude Peter Csaba Ölveczky1,2 and José Meseguer 1 1 Department of Computer Science, University of Illinois at Urbana-Champaign 2 Department
More informationGraphical Tool For SC Automata.
Graphical Tool For SC Automata. Honours Project: 2000 Dr. Padmanabhan Krishnan 1 Luke Haslett 1 Supervisor Abstract SC automata are a variation of timed automata which are closed under complementation.
More informationConceptual Modeling of Web Service Conversations
Conceptual Modeling of Web Service Conversations Boualem Benatallah 1, Fabio Casati 2, Farouk Toumani 3, and Rachid Hamadi 1 1 School of Computer Science and Engineering The University of New South Wales,
More informationMixup: a Development and Runtime Environment for Integration at the Presentation Layer
Mixup: a Development and Runtime Environment for Integration at the Presentation Layer Jin Yu 1, Boualem Benatallah 1, Fabio Casati 2, Florian Daniel 3, Maristella Matera 3 and Regis Saint-Paul 1 1 University
More informationWeb Ontology Language for Service (OWL-S) The idea of Integration of web services and semantic web
Web Ontology Language for Service (OWL-S) The idea of Integration of web services and semantic web Introduction OWL-S is an ontology, within the OWL-based framework of the Semantic Web, for describing
More informationTimo Latvala. January 28, 2004
Reactive Systems: Kripke Structures and Automata Timo Latvala January 28, 2004 Reactive Systems: Kripke Structures and Automata 3-1 Properties of systems invariants: the system never reaches a bad state
More informationCS 310: State Transition Diagrams
CS 30: State Transition Diagrams Stefan D. Bruda Winter 207 STATE TRANSITION DIAGRAMS Finite directed graph Edges (transitions) labeled with symbols from an alphabet Nodes (states) labeled only for convenience
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2018 http://cseweb.ucsd.edu/classes/sp18/cse105-ab/ Today's learning goals Sipser Section 2.2 Define push-down automata informally and formally Trace the computation
More informationJ2EE APIs and Emerging Web Services Standards
J2EE APIs and Emerging Web Services Standards Session #4 Speaker Title Corporation 1 Agenda J2EE APIs for Web Services J2EE JAX-RPC APIs for Web Services JAX-RPC Emerging Web Services Standards Introduction
More informationLexical Analysis. Implementation: Finite Automata
Lexical Analysis Implementation: Finite Automata Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs)
More informationModel Checking with Automata An Overview
Model Checking with Automata An Overview Vanessa D Carson Control and Dynamical Systems, Caltech Doyle Group Presentation, 05/02/2008 VC 1 Contents Motivation Overview Software Verification Techniques
More informationTowards Validated Real-Time Software
Towards Validated Real-Time Software Valérie BERTIN, Michel POIZE, Jacques PULOU France Télécom - Centre National d'etudes des Télécommunications 28 chemin du Vieux Chêne - BP 98-38243 Meylan cedex - France
More informationAutomating Construction of Lexers
Automating Construction of Lexers Regular Expression to Programs Not all regular expressions are simple. How can we write a lexer for (a*b aaa)? Tokenizing aaaab Vs aaaaaa Regular Expression Finite state
More informationThe UPPAAL Model Checker. Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN
The UPPAAL Model Checker Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN The aim of this presentation Introduce the basic concepts of model checking from a practical perspective Describe
More informationActiveVOS Technologies
ActiveVOS Technologies ActiveVOS Technologies ActiveVOS provides a revolutionary way to build, run, manage, and maintain your business applications ActiveVOS is a modern SOA stack designed from the top
More informationSoftware Service Engineering
Software Service Engineering Lecture 4: Service Modeling Doctor Guangyu Gao Some contents and notes selected from Service Oriented Architecture by Michael McCarthy 1. Place in Service Lifecycle 2 Content
More informationLast lecture CMSC330. This lecture. Finite Automata: States. Finite Automata. Implementing Regular Expressions. Languages. Regular expressions
Last lecture CMSC330 Finite Automata Languages Sets of strings Operations on languages Regular expressions Constants Operators Precedence 1 2 Finite automata States Transitions Examples Types This lecture
More informationWe recommend you review this before taking an ActiveVOS course or before you use ActiveVOS Designer.
This presentation is a primer on WSDL. It s part of our series to help prepare you for creating BPEL projects. We recommend you review this before taking an ActiveVOS course or before you use ActiveVOS
More informationEnterprise Integration
Departamento de Engenharia Informática Enterprise Integration Asynchronous BPEL process Tutorial IE 2016 In this tutorial, we shall create an asynchronous BPEL process in JDeveloper 11g, deploy and test
More informationParametric Real Time System Feasibility Analysis Using Parametric Timed Automata
Parametric Real Time System Feasibility Analysis Using Parametric Timed Automata PhD Dissertation Yusi Ramadian Advisor : Luigi Palopoli Co advisor : Alessandro Cimatti 1 Real Time System Applications
More informationCS5371 Theory of Computation. Lecture 8: Automata Theory VI (PDA, PDA = CFG)
CS5371 Theory of Computation Lecture 8: Automata Theory VI (PDA, PDA = CFG) Objectives Introduce Pushdown Automaton (PDA) Show that PDA = CFG In terms of descriptive power Pushdown Automaton (PDA) Roughly
More informationGrammar vs. Rules. Diagnostics in XML Document Validation. Petr Nálevka
Grammar vs. Rules Diagnostics in XML Document Validation Petr Nálevka University of Economics, Prague Dept. of Information and Knowledge Engineering petr@nalevka.com http://nalevka.com This presentation
More informationT Reactive Systems: Kripke Structures and Automata
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Kripke Structures and Automata Spring 2005, Lecture 3 January 31, 2005 Tik-79.186 Reactive Systems 2 Properties of systems invariants: the system
More informationA Methodology for On-line Monitoring Non-Functional Specifications of Web-Services
A Methodology for On-line Monitoring Non-Functional Specifications of Web-Services Franco Raimondi 1,2 James Skene 3 Wolfgang Emmerich 4 Department of Computer Science University College London London,
More information02267: Software Development of Web Services
02267: Software Development of Web Services Week 1 Hubert Baumeister huba@dtu.dk Department of Applied Mathematics and Computer Science Technical University of Denmark Fall 2013 Contents Course Introduction
More informationActiveBPEL Fundamentals
Unit 22: Simulation ActiveBPEL Fundamentals This is Unit #22 of the BPEL Fundamentals course. In past Units we ve looked at ActiveBPEL Designer, Workspaces and Projects, created the Process itself and
More informationImplementation of Lexical Analysis
Implementation of Lexical Analysis Lecture 4 (Modified by Professor Vijay Ganesh) Tips on Building Large Systems KISS (Keep It Simple, Stupid!) Don t optimize prematurely Design systems that can be tested
More informationImplementation of Lexical Analysis
Implementation of Lexical Analysis Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs) Implementation
More informationSAVARA 1.0 Getting Started Guide
SAVARA 1.0 Getting Started Guide by Gary Brown and Jeff Yu 1. Overview... 1 2. Installation... 2 3. 4. 5. 6. 7. 2.1. Prerequisites... 2 2.2. Installation Instructions... 2 2.3. Importing Samples into Eclipse...
More informationConverting a DFA to a Regular Expression JP
Converting a DFA to a Regular Expression JP Prerequisite knowledge: Regular Languages Deterministic Finite Automata Nondeterministic Finite Automata Regular Expressions Conversion of Regular Expression
More informationImplementation of Lexical Analysis
Implementation of Lexical Analysis Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs) Implementation
More informationASPECTUAL PATTERNS FOR WEB SERVICES ADAPTATION
ASPECTUAL PATTERNS FOR WEB SERVICES ADAPTATION Najme Abbasi Tehrani and Afshin Salajegheh Department of Computer Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran ABSTRACT The security
More informationModeling, Testing and Executing Reo Connectors with the. Reo, Eclipse Coordination Tools
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. Modeling, Testing and Executing Reo Connectors with the
More informationJava J Course Outline
JAVA EE - J2SE - CORE JAVA After all having a lot number of programming languages. Why JAVA; yet another language!!! AND NOW WHY ONLY JAVA??? CHAPTER 1: INTRODUCTION What is Java? History Versioning The
More informationA Dream of Software Engineers -- Service Orientation and Cloud Computing
JICSIT2011 / ITAIC 2011 Keynote http://www.jicsit.org/ A Dream of Software Engineers -- Service Orientation and Cloud Computing Yinong Chen Arizona State University, Tempe, Arizona, U.S.A. JICSIT/ITAIC
More informationH2 2/3/2006. (c) (5 points) Name the three main primitive patterns of interoperability among workflows.
Problem 1 2 3 4 Total Points: 25 25 30 20 100 Score: This homework assignment has 4 problems, for a total of 100 points. 1. (a) (5 points) The following is not a shortcoming of RosettaNet Partner Interface
More informationFachgebiet Softwaretechnik, Heinz Nixdorf Institut, Universität Paderborn. 2.3 Timed Automata and Real-Time Statecharts
2.3 Timed Automata and Real-Time Statecharts Develop a BOOK RATING APP and win awesome prizes! The creators of the best submissions will be invited to an exclusive party in February
More informationBlack-Box Components using Abstraction
Generating Models of Black-Box Components using Abstraction Bengt Jonsson Uppsala University Joint work with Fides Aarts 1, Falk Howar 2, Bernhard Steffen 2, Johan Uijen 1 1: Radboud University, Nijmegen
More informationAutomated Test Generation using Model-Checking: An Industrial Evaluation
Automated Test Generation using Model-Checking: An Industrial Evaluation Eduard P. Enoiu 1, Adnan Čaušević 1, Thomas J. Ostrand 3, Elaine J. Weyuker 1, Daniel Sundmark 12, and Paul Pettersson 1 1 Mälardalen
More informationA graphical user interface for service adaptation
A graphical user interface for service adaptation Christian Gierds 1 and Niels Lohmann 2 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099 Berlin, Germany gierds@informatik.hu-berlin.de
More informationMODEL-BASED DESIGN OF CODE FOR PLC CONTROLLERS
Krzysztof Sacha Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, Poland k.sacha@ia.pw.edu.pl Keywords: Abstract: Automatic program generation, Model verification, Finite state machine,
More informationRational subsets in HNN-extensions
Rational subsets in HNN-extensions G. Sénizergues joint work with M. Lohrey ROUPE DE TRAVAIL-LGL-28/02/06 1 0- PLAN 0 INTRODUCTION 0.1 Problems 0.2 Motivations 0.3 Results 0.4 Tools 1- HNN EXTENSIONS 1.1
More informationConservative re-use ensuring matches for service selection
Conservative re-use ensuring matches for service selection M. Baldoni, C. Baroglio, V. Patti, and C. Schifanella Dipartimento di Informatica Università degli Studi di Torino C.so Svizzera, 185 I-10149
More informationKahina Gani, Marinette Bouet, Michel Schneider, and Farouk Toumani. 1 2
Modeling Home Care Plans Kahina Gani, Marinette Bouet, Michel Schneider, and Farouk Toumani. 1 2 Research Report LIMOS/RR-14-02 12 mai 2014 1. {gani,michel.schneider,ftoumani}@isima.fr 2. marinette.bouet@univ-bpclermont.fr
More informationFinite Automata. Dr. Nadeem Akhtar. Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur
Finite Automata Dr. Nadeem Akhtar Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur PhD Laboratory IRISA-UBS University of South Brittany European University
More informationReducing Clocks in Timed Automata while Preserving Bisimulation
Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2
More informationTurning Web Applications into Web Services by Wrapping Techniques
Turning Web Applications into Web Services by Wrapping Techniques Giusy Di Lorenzo Anna Rita Fasolino Lorenzo Melcarne Porfirio Tramontana Valeria Vittorini Dipartimento di Informatica e Sistemistica University
More informationGoal: Offer practical information to help the architecture evaluation of an SOA system. Evaluating a Service-Oriented Architecture
Evaluating a Service-Oriented Architecture Paulo Merson, SEI with Phil Bianco, SEI Rick Kotermanski, Summa Technologies May 2007 Goal: Offer practical information to help the architecture evaluation of
More informationDepartamento de Engenharia Informática. Systems Integration. Web Services and BPEL Tutorial
Departamento de Engenharia Informática Systems Integration Web Services and BPEL Tutorial IE 2016 In this tutorial, we shall create a Web service in Java that validates a credit card number. In addition,
More informationMETEOR-S Process Design and Development Tool (PDDT)
METEOR-S Process Design and Development Tool (PDDT) Ranjit Mulye LSDIS Lab, University of Georgia (Under the Direction of Dr. John A. Miller) Acknowledgements Advisory Committee Dr. John A. Miller (Major
More informationOracle Exam 1z0-478 Oracle SOA Suite 11g Certified Implementation Specialist Version: 7.4 [ Total Questions: 75 ]
s@lm@n Oracle Exam 1z0-478 Oracle SOA Suite 11g Certified Implementation Specialist Version: 7.4 [ Total Questions: 75 ] Question No : 1 Identify the statement that describes an ESB. A. An ESB provides
More informationReasoning about Timed Systems Using Boolean Methods
Reasoning about Timed Systems Using Boolean Methods Sanjit A. Seshia EECS, UC Berkeley Joint work with Randal E. Bryant (CMU) Kenneth S. Stevens (Intel, now U. Utah) Timed System A system whose correctness
More informationlec3:nondeterministic finite state automata
lec3:nondeterministic finite state automata 1 1.introduction Nondeterminism is a useful concept that has great impact on the theory of computation. When the machine is in a given state and reads the next
More informationModelling (and Analyzing) Interorganizational Communication. Jan Martijn van der Werf
Modelling (and Analyzing) Interorganizational Communication Jan Martijn van der Werf 1 2 Interaction Interaction in networks Bob Charley Alice Dave 3 Bob Can you Charley, you do Interaction in networks
More informationRequirements for Rules Interoperability
Requirements for Rules Interoperability Ed Barkmeyer, Ravi Raman, Evan Wallace Manufacturing Engineering Laboratory NIST NIST Presentation - W3C Rules Workshop 1 General Architecture Multiple ontology
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationTowards Schema-Guided XML Query Induction
Towards Schema-Guided XML Query Induction Jérôme Champavère Rémi Gilleron Aurélien Lemay Joachim Niehren Université de Lille INRIA, France ICML-2007 Workshop on Challenges and Applications of Grammar Induction
More informationXML Research for Formal Language Theorists
XML Research for Formal Language Theorists Wim Martens TU Dortmund Wim Martens (TU Dortmund) XML for Formal Language Theorists May 14, 2008 1 / 65 Goal of this talk XML Research vs Formal Languages Wim
More informationEvaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation Philippe Dhaussy 1, Pierre-Yves Pillain 1, Stephen Creff 1, Amine Raji 1, Yves Le Traon 2, Benoit Baudry
More information21. Business Process Analysis (3)
21. Business Process Analysis (3) DE + IA (INFO 243) - 2 April 2008 Bob Glushko 1 of 43 4/1/2008 3:34 PM Plan for Today's Class Business Transaction Patterns Business Signals Collaborations and Choreography
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Today's learning goals Sipser Ch 1.2, 1.3 Design NFA recognizing a given language Convert an NFA (with or without
More informationOracle Developer Day
Oracle Developer Day Sponsored by: Track # 1: Session #2 Web Services Speaker 1 Agenda Developing Web services Architecture, development and interoperability Quality of service Security, reliability, management
More informationSOA Gateway BusinessDataViews
SOA Gateway enables physical assets (tables, files, etc.) to be exposed as "atomic" WebServices, which is useful when direct access to these resources is required. However, it is often the case that a
More informationEditor. Analyser XML. Scheduler. generator. Code Generator Code. Scheduler. Analyser. Simulator. Controller Synthesizer.
TIMES - A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi? Uppsala University, Sweden Abstract. Times is a new modelling,
More informationOn the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
SVC On the Language Inclusion Problem for Timed Automata 1 On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap Joël Ouaknine Computer Science Department, Carnegie Mellon University
More information