Modelling and Analysis of Time-related Properties in Web Service Compositions Raman KazhamiakinParitosh K. PandyaMarco Pistore

Slides:



Advertisements
Similar presentations
Generating test cases specifications for BPEL compositions of web services using SPIN José García-Fanjul, Javier Tuya, and Claudio de la Riva Pointner.
Advertisements

CS 267: Automated Verification Lecture 8: Automata Theoretic Model Checking Instructor: Tevfik Bultan.
Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
1 Model checking. 2 And now... the system How do we model a reactive system with an automaton ? It is convenient to model systems with Transition systems.
An Introduction to the Model Verifier verds Wenhui Zhang September 15 th, 2010.
UPPAAL Introduction Chien-Liang Chen.
Timed Automata.
Model Checker In-The-Loop Flavio Lerda, Edmund M. Clarke Computer Science Department Jim Kapinski, Bruce H. Krogh Electrical & Computer Engineering MURI.
Software Quality Assurance Plan
Verification of Hybrid Systems An Assessment of Current Techniques Holly Bowen.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
An Automata-based Approach to Testing Properties in Event Traces H. Hallal, S. Boroday, A. Ulrich, A. Petrenko Sophia Antipolis, France, May 2003.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
EMS Auditing Definitions
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
Copyright © 2006 Software Quality Research Laboratory DANSE Software Quality Assurance Tom Swain Software Quality Research Laboratory University of Tennessee.
On-the-fly Model Checking from Interval Logic Specifications Manuel I. Capel & Miguel J. Hornos Dept. Lenguajes y Sistemas Informáticos Universidad de.
Sanjit A. Seshia and Randal E. Bryant Computer Science Department
Review of the automata-theoretic approach to model-checking.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley System-Level Types for Component-Based Design Edward A.
System-Level Types for Component-Based Design Paper by: Edward A. Lee and Yuhong Xiong Presentation by: Dan Patterson.
Ministry of Transport, Information Technology and Communications Technological base: Interoperability Tsvetanka Kirilova Ministry of TITC Bulgaria.
Romaric GUILLERM Hamid DEMMOU LAAS-CNRS Nabil SADOU SUPELEC/IETR ESM'2009, October 26-28, 2009, Holiday Inn Leicester, Leicester, United Kingdom.
Zoltán Mann: Tracing CORBA applications 1/22 Tracing CORBA applications using interceptors Zoltán Mann Supervisor: Dr. Károly Kondorosi Budapest University.
Process-oriented System Automation Executable Process Modeling & Process Automation.
1 Carnegie Mellon UniversitySPINFlavio Lerda Bug Catching SPIN An explicit state model checker.
Presenter : Cheng-Ta Wu Vijay D’silva, S. Ramesh Indian Institute of Technology Bombay Arcot Sowmya University of New South Wales, Sydney.
Verification technique on SA applications using Incremental Model Checking 컴퓨터학과 신영주.
Romaric GUILLERM Hamid DEMMOU LAAS-CNRS Nabil SADOU SUPELEC/IETR.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
PMP® Exam Preparation Course
Timed UML State Machines Ognyana Hristova Tutor: Priv.-Doz. Dr. Thomas Noll June, 2007.
A Usable Reachability Analyser Victor Khomenko Newcastle University.
Mathematical Modeling and Formal Specification Languages CIS 376 Bruce R. Maxim UM-Dearborn.
Computer Science and Engineering 1 Service-Oriented Architecture Security 2.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Timed Use Case Maps Jameleddine Hassine Concordia University, Montreal, Canada URN Meeting, Ottawa, January 16-18, 2008.
16 August Verilog++ Assertion Extension Requirements Proposal.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems Frits Vaandrager, University of Nijmegen joint work with Dilsun.
Page 1 Analysis of Asynchronous Systems Steven P. Miller Michael W. Whalen {spmiller, Advanced Computing Systems Rockwell.
By, Venkateswara Reddy. Tallapu Reddy. 1.Introduction. 2.What is X-Machine Testing..?? 3.Methods of X-Machine Testing. 4.Variants of X- Machine. 5.Stream.
UPPAAL-based Software-Defined Network Verification Uliana Popesko Lomonosov Moscow State University 2014.
- 1 -  P. Marwedel, Univ. Dortmund, Informatik 12, 05/06 Universität Dortmund Validation - Formal verification -
16/11/ Semantic Web Services Language Requirements Presenter: Emilia Cimpian
Towards Interoperability Test Generation of Time Dependent Protocols: a Case Study Zhiliang Wang, Jianping Wu, Xia Yin Department of Computer Science Tsinghua.
Verification & Validation By: Amir Masoud Gharehbaghi
Predicate Abstraction. Abstract state space exploration Method: (1) start in the abstract initial state (2) use to compute reachable states (invariants)
Constraints Assisted Modeling and Validation Presented in CS294-5 (Spring 2007) Thomas Huining Feng Based on: [1]Constraints Assisted Modeling and Validation.
Integrated Change Control 1 MEC-8. Processing of a Change Processing of a Change 2 Assess Impact within KA Change Request Implemented Change Create a.
Course: COMS-E6125 Professor: Gail E. Kaiser Student: Shanghao Li (sl2967)
A Mediated Approach towards Web Service Choreography Michael Stollberg, Dumitru Roman, Juan Miguel Gomez DERI – Digital Enterprise Research Institute
Qusay H. Mahmoud CIS* CIS* Service-Oriented Computing Qusay H. Mahmoud, Ph.D.
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
Report Performance Monitor & Control Risk Administer Procurement MONITORING & CONTROLLING PROCESS.
Winter 2007SEG2101 Chapter 121 Chapter 12 Verification and Validation.
Automated Formal Verification of PLC (Programmable Logic Controller) Programs
From Natural Language to LTL: Difficulties Capturing Natural Language Specification in Formal Languages for Automatic Analysis Elsa L Gunter NJIT.
Symbolic Model Checking of Software Nishant Sinha with Edmund Clarke, Flavio Lerda, Michael Theobald Carnegie Mellon University.
CS5270 Lecture 41 Timed Automata I CS 5270 Lecture 4.
Victor Khomenko Newcastle University
Formal methods: Lecture
Synthesis from scenarios and requirements
Analysis of Communication Models in Web Service Compositions Marco Pistore University of Trento Joint work with Raman Kazhamiakin.
Gabor Madl Ph.D. Candidate, UC Irvine Advisor: Nikil Dutt
Retrieve Protocol for Execution (RPE)
CSEP590 – Model Checking and Automated Verification
Translating Linear Temporal Logic into Büchi Automata
Rich Model Toolkit – An Infrastructure for Reliable Computer Systems
Presentation transcript:

Modelling and Analysis of Time-related Properties in Web Service Compositions Raman KazhamiakinParitosh K. PandyaMarco Pistore

WESC'052 Problem in Hands Service composition distributed business processesService composition as a way to obtain new functionality by combining existing services into distributed business processes re-usage of existing heterogeneous applications BPEL behaviorstack of standards (e.g. BPEL) for different aspects of WS compositions (e.g. behavior) correctnessAnalyze correctness of the WS composition quantitativequantitative properties (deadlocks, livelocks, LTL properties) qualitativequalitative properties (performance, time, resource allocation) Time-related Time-related properties are particularly relevant necessity to support Long-Running Transactions compatibility of time-consuming tasks w.r.t. the expected timing constraints compatibility of local timed commitments of different involved parties

WESC'053 Case Study: e-Government Application Environmental Protection AgencyDomain: Environmental Protection Agency authorization for the establishment and operation of a waste disposal or recycling plant complex distributed processSettings: complex distributed process involving various actors state authorities (province board) local public services (agencies, administrations, secretaries) consultants and experts (environmental engineers) process clients (companies, information requestors) composition of Web ServicesScenario: composition of Web Services representing actors’ interfaces BPEL specifications to model the behavior of each participant long-term process that also contains time-consuming activities necessity to comply with variety of functional and timing constraints posed by different parties

WESC'054 Procedure Manager Province Board Technical Committee Secretary Service Waste Management Office Citizen Service Initial Request Register Protocol Preliminary Notification Evaluate Documents Prepare Integration Public Notification Receive Notification Receive Notification Provide Integration Collect Integration Start Procedure Invoke TC Technical Analysis Verify Reviews Conference Call Modify Date Final Call Provide Evaluation Provide Evaluation Conference Send Acts Receive Acts Provide Decision Receive Decision

WESC'055 Procedure Manager Province Board Technical Committee Secretary Service Waste Management Office Citizen Service Initial Request Register Protocol Preliminary Notification Evaluate Documents Prepare Integration Public Notification Receive Notification Receive Notification Provide Integration Collect Integration Start Procedure Invoke TC Technical Analysis Verify Reviews Conference Call Modify Date Final Call Provide Evaluation Provide Evaluation Conference Send Acts Receive Acts Provide Decision Receive Decision Long activities: manual tasks, decisions,… Timeouts Within 5 days

WESC'056 Procedure Manager Province Board Technical Committee Secretary Service Waste Management Office Citizen Service Initial Request Register Protocol Preliminary Notification Evaluate Documents Prepare Integration Public Notification Receive Notification Receive Notification Provide Integration Collect Integration Start Procedure Invoke TC Technical Analysis Verify Reviews Conference Call Modify Date Final Call Provide Evaluation Provide Evaluation Conference Send Acts Receive Acts Provide Decision Receive Decision Complex timed requirements: Constraints, regulations, commitments Within 30 days after registration At least 5 days before conference Within 30 days after registration, and at least 10 days before conference Within 90 days after the 1 st call

WESC'057 Timed analysis GoalGoal Analysis of time-related issues in WS compositions defined by a set of BPEL specifications Formalize the composition model with explicit representation of time Represent BPEL timed constructs and activity durations annotations Represent and analyze complex timed requirements and constraints Concentrate on “business” time and neglect “technical” time SolutionSolution WSTTSWeb Service Timed State Transition System (composition behavior) DC(subset of) Duration Calculus (complex timed requirements) ImplementationImplementation Discrete time model Quantified Discrete-time Duration Calculus + DCVALID tool NuSMV state of the art model checker

WESC'058 previous workBased on previous work on non-timed analysis of BPEL compositions Timed AutomataClosely related to the formalism of Timed Automata WS Timed State Transition SystemEach BPEL process is encoded as WS Timed State Transition System WSTTS (X, S, s 0, A, Tr, Inv): X – set of global clocks (timers) S – set of states, s 0 – initial state A – set of actions (message input, message output, internal action) Tr – S x A x Φ x 2 X x S – transition relation Inv – invariants function from S to Φ where φ in Φ has the form true | φ 1 AND φ 2 | x ~ c with ~ in {>, =,<=} Formal Model SS’ a φ Y:=0 Action a is fired condition φ over timers is true timers in subset Y are reset

WESC'059 previous workBased on previous work on non-timed analysis of BPEL compositions Timed AutomataClosely related to the formalism of Timed Automata WS Timed State Transition SystemEach BPEL process is encoded as WS Timed State Transition System Semantics of WSTTS network: Global Timed Transitions System Time elapsing transition: global state is not changed all timers synchronously increment Internal action of some WSTTS: internal transition of some WSTTS is executed timers are not changes Shared communication action of two WSTTS: two WSTTS execute shared transitions timers are not changes Formal Model X’:=X+d X’:=X a

WESC'0510 Instant activities Mapping to WSTTS <invoke name="Customer Call“ operation="sendCall“ partnerLink="CustomerPL"/> x := 0 x ≤ 0 sendCall Duration annotations <empty name=“Verify Reviews“ duration=“lessEqual(3D)”/> x := 0 x ≤ 0 x ≤ 3 BPEL timeout (for) … x := 0 x ≤ 5 modifyDate x = 5 BPEL timeout (until) … x := 0 gt ≤ 12 modifyDate gt = 12

WESC'0511 Formal Model : Interval Specifications Duration CalculusDuration Calculus Properties over intervals Allows to express complex timed requirements of behavioral specifications [P] 0 Single state satisfying propositional formula P [[P]P is satisfied in all states of the behavior (except the last one) D 1 ^D 2 D 1 is satisfied in the 1 st subinterval of behavior and D 2 in the 2 nd D 1 AND D 2 Interval satisfies both formulae ¬DInterval does not satisfy the formula len ~ cThe duration of interval is ~ c P PPPPP¬P¬P D1D1 D2D2 D1D1 D2D2 D1D1 x =ax =a+c

WESC'0512 Interval Formula Example Every intervalregistration conferencetwo subintervalscall in between 1 st lasts at most 302 nd at least 10 Every interval of the behavior that starts with the registration and ends with the conference consists of two subintervals with the call in between, such that the 1 st lasts at most 30, and the 2 nd at least 10 days. registrationconferencecall len ≤ 30len ≥ 10 [] ( ([registration] 0 ^ true ^ [conference] 0 ) → ( (len ≤ 30) ^ [call] 0 ^ (len ≥ 10) ) )

WESC'0513 Implementation [Annotated] BPEL specifications WSTTS composition model NuSMV Specification Timed assumptions (QDDC) Verification properties (LTL,QDDC) NuSMV model checker Counterexample 1. Translate annotated BPEL specification into WSTTS composition model M 2. Translate QDDC properties D i into automata A(D i ) 3. Translate (negation of) property P into automaton A(¬P) 4. Generate NuSMV specification for the behavioral analysis 5. Verification and counterexample generation

WESC'0514 Conclusions What is done…What is done… modelling and analysis of time-related properties of WS compositions Formal model for the definition of timed behavior of the composition Mapping of BPEL constructs Extension with durations annotations for modelling of simple properties Application of duration calculus for modelling of complex requirements What is to be done…What is to be done… Translation optimizations and better analysis techniques State space clustering math-sat techniques Alternative encoding UPPAAL model checking Quantitative Analysis Automated extraction of time bounds from the specifications

WESC'0515 Questions ?