Modeling and Verifying Web Service Applications with Time Constraints

Abstract

Web services are a very appropriate communication mechanism to perform distributed business processes among several organizations. These processes should be reliable, because a failure in them can cause high economic losses. In this paper, we present an approach to verify Web Service applications with time restrictions which are defined by BPEL4WS using model checking techniques. We introduce a formalism, called WS Timed Automata, to capture the timed behavior of the web service applications, and methods to translate description of web service applications written in BPEL4WS to WS Timed Automata is proposed in this paper. The formal verification tool Uppaal is used to verify related properties of the system. A particular case study, an airline travel reservation system is taken as illustration.