Analysis and applications of timed service protocols

Julien Ponge, Boualem Benatallah, Fabio Casati, Farouk Toumani

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted that a service description should include not only the interface, but also the business protocol supported by the service. The present work focuses on the formalization of an important category of protocols that includes time-related constraints (called timed protocols), and the impact of time on compatibility and replaceability analysis. We formalized the following timing constraints: C-Invoke constraints define time windows within which a service operation can be invoked while M-Invoke constraints define expiration deadlines. We extended techniques for compatibility and replaceability analysis between timed protocols by using a semantic-preserving mapping between timed protocols and timed automata, leading to the identification of a novel class of timed automata, called protocol timed automata (PTA). PTA exhibit a particular kind of silent transition that strictly increase the expressiveness of the model, yet they are closed under complementation, making every type of compatibility or replaceability analysis decidable. Finally, we implemented our approach in the context of a larger project called ServiceMosaic, a model-driven framework for Web service life-cycle management.

Original languageEnglish
Article number11
JournalACM Transactions on Software Engineering and Methodology
Volume19
Issue number4
DOIs
Publication statusPublished - 1 Apr 2010
Externally publishedYes

Fingerprint

Network protocols
Web services
Service life
Interfaces (computer)
Life cycle
Industry
Semantics

Keywords

  • Compatiblity and replaceability analysis
  • Timed automata
  • Timed business protocols
  • Web services

ASJC Scopus subject areas

  • Software

Cite this

Analysis and applications of timed service protocols. / Ponge, Julien; Benatallah, Boualem; Casati, Fabio; Toumani, Farouk.

In: ACM Transactions on Software Engineering and Methodology, Vol. 19, No. 4, 11, 01.04.2010.

Research output: Contribution to journalArticle

Ponge, Julien ; Benatallah, Boualem ; Casati, Fabio ; Toumani, Farouk. / Analysis and applications of timed service protocols. In: ACM Transactions on Software Engineering and Methodology. 2010 ; Vol. 19, No. 4.
@article{dddf49481081438d94ef96d00bc342bb,
title = "Analysis and applications of timed service protocols",
abstract = "Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted that a service description should include not only the interface, but also the business protocol supported by the service. The present work focuses on the formalization of an important category of protocols that includes time-related constraints (called timed protocols), and the impact of time on compatibility and replaceability analysis. We formalized the following timing constraints: C-Invoke constraints define time windows within which a service operation can be invoked while M-Invoke constraints define expiration deadlines. We extended techniques for compatibility and replaceability analysis between timed protocols by using a semantic-preserving mapping between timed protocols and timed automata, leading to the identification of a novel class of timed automata, called protocol timed automata (PTA). PTA exhibit a particular kind of silent transition that strictly increase the expressiveness of the model, yet they are closed under complementation, making every type of compatibility or replaceability analysis decidable. Finally, we implemented our approach in the context of a larger project called ServiceMosaic, a model-driven framework for Web service life-cycle management.",
keywords = "Compatiblity and replaceability analysis, Timed automata, Timed business protocols, Web services",
author = "Julien Ponge and Boualem Benatallah and Fabio Casati and Farouk Toumani",
year = "2010",
month = "4",
day = "1",
doi = "10.1145/1734229.1734230",
language = "English",
volume = "19",
journal = "ACM Transactions on Software Engineering and Methodology",
issn = "1049-331X",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Analysis and applications of timed service protocols

AU - Ponge, Julien

AU - Benatallah, Boualem

AU - Casati, Fabio

AU - Toumani, Farouk

PY - 2010/4/1

Y1 - 2010/4/1

N2 - Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted that a service description should include not only the interface, but also the business protocol supported by the service. The present work focuses on the formalization of an important category of protocols that includes time-related constraints (called timed protocols), and the impact of time on compatibility and replaceability analysis. We formalized the following timing constraints: C-Invoke constraints define time windows within which a service operation can be invoked while M-Invoke constraints define expiration deadlines. We extended techniques for compatibility and replaceability analysis between timed protocols by using a semantic-preserving mapping between timed protocols and timed automata, leading to the identification of a novel class of timed automata, called protocol timed automata (PTA). PTA exhibit a particular kind of silent transition that strictly increase the expressiveness of the model, yet they are closed under complementation, making every type of compatibility or replaceability analysis decidable. Finally, we implemented our approach in the context of a larger project called ServiceMosaic, a model-driven framework for Web service life-cycle management.

AB - Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted that a service description should include not only the interface, but also the business protocol supported by the service. The present work focuses on the formalization of an important category of protocols that includes time-related constraints (called timed protocols), and the impact of time on compatibility and replaceability analysis. We formalized the following timing constraints: C-Invoke constraints define time windows within which a service operation can be invoked while M-Invoke constraints define expiration deadlines. We extended techniques for compatibility and replaceability analysis between timed protocols by using a semantic-preserving mapping between timed protocols and timed automata, leading to the identification of a novel class of timed automata, called protocol timed automata (PTA). PTA exhibit a particular kind of silent transition that strictly increase the expressiveness of the model, yet they are closed under complementation, making every type of compatibility or replaceability analysis decidable. Finally, we implemented our approach in the context of a larger project called ServiceMosaic, a model-driven framework for Web service life-cycle management.

KW - Compatiblity and replaceability analysis

KW - Timed automata

KW - Timed business protocols

KW - Web services

UR - http://www.scopus.com/inward/record.url?scp=77951783955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951783955&partnerID=8YFLogxK

U2 - 10.1145/1734229.1734230

DO - 10.1145/1734229.1734230

M3 - Article

VL - 19

JO - ACM Transactions on Software Engineering and Methodology

JF - ACM Transactions on Software Engineering and Methodology

SN - 1049-331X

IS - 4

M1 - 11

ER -