Authors:
Serge Haddad
1
;
Patrice Moreaux
2
and
Sylvain Rampacek
3
Affiliations:
1
LAMSADE, Université Paris Dauphine, France
;
2
LISTIC-ESIA, Université de Savoie, France
;
3
CReSTIC, Université de Reims Champagne-Ardenne, UFR Sciences de Reims, France
Keyword(s):
Web Services, BPEL4WS, Algebra of timed processes, Timed Automata.
Related
Ontology
Subjects/Areas/Topics:
Enterprise Information Systems
;
Internet and Collaborative Computing
;
Intranet and Extranet Business Applications
;
Process Design and Organisational Issues in E-Commerce
;
Software Agents and Internet Computing
Abstract:
A complex Web service described with languages like BPEL4WS, consists of an executable process and its observable behaviour (called an abstract process) based on the messages exchanged with the client. The abstract process behaviour is non deterministic due to the internal choices during the service execution. Furthermore the specification often includes timing constraints which must be taken into account by the client. Thus given a service specification, we identify the synthesis of a client as a key issue for the development of Web services. To this end, we propose an approach based on (dense) timed automata to first describe the observable service behaviour and then to build correct interacting clients when possible. The present work extends a previous discrete time approach and overcomes its limitations.