Fine-grained compatibility and replaceability analysis of timed web service protocols

Julien Ponge, Boualem Benatallah, Fabio Casati, Farouk Toumani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Citations (Scopus)

Abstract

We deal with the problem of automated analysis of web service protocol compatibility and replaceability in presence of timing abstractions, We first present a timed protocol model for services and identify different levels of compatibility and replaceability that are useful to support service development and evolution. Next, we present operators that can perform such analysis. Finally, we present operators properties by showing that timed protocols form a new class of timed automata, and we briefly present our implementation.

Original languageEnglish
Title of host publicationConceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings
Pages599-614
Number of pages16
Volume4801 LNCS
Publication statusPublished - 2007
Externally publishedYes
Event26th International Conference on Conceptual Modeling, ER 2007 - Auckland, New Zealand
Duration: 5 Nov 20079 Nov 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4801 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Conference on Conceptual Modeling, ER 2007
CountryNew Zealand
CityAuckland
Period5.11.079.11.07

Fingerprint

Compatibility
Web services
Web Services
Network protocols
Timed Automata
Operator
Timing
Model
Abstraction
Class

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ponge, J., Benatallah, B., Casati, F., & Toumani, F. (2007). Fine-grained compatibility and replaceability analysis of timed web service protocols. In Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings (Vol. 4801 LNCS, pp. 599-614). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4801 LNCS).

Fine-grained compatibility and replaceability analysis of timed web service protocols. / Ponge, Julien; Benatallah, Boualem; Casati, Fabio; Toumani, Farouk.

Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings. Vol. 4801 LNCS 2007. p. 599-614 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4801 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ponge, J, Benatallah, B, Casati, F & Toumani, F 2007, Fine-grained compatibility and replaceability analysis of timed web service protocols. in Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings. vol. 4801 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4801 LNCS, pp. 599-614, 26th International Conference on Conceptual Modeling, ER 2007, Auckland, New Zealand, 5.11.07.
Ponge J, Benatallah B, Casati F, Toumani F. Fine-grained compatibility and replaceability analysis of timed web service protocols. In Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings. Vol. 4801 LNCS. 2007. p. 599-614. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ponge, Julien ; Benatallah, Boualem ; Casati, Fabio ; Toumani, Farouk. / Fine-grained compatibility and replaceability analysis of timed web service protocols. Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings. Vol. 4801 LNCS 2007. pp. 599-614 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{351ea28b038a4e1ca59c3800b0cc514a,
title = "Fine-grained compatibility and replaceability analysis of timed web service protocols",
abstract = "We deal with the problem of automated analysis of web service protocol compatibility and replaceability in presence of timing abstractions, We first present a timed protocol model for services and identify different levels of compatibility and replaceability that are useful to support service development and evolution. Next, we present operators that can perform such analysis. Finally, we present operators properties by showing that timed protocols form a new class of timed automata, and we briefly present our implementation.",
author = "Julien Ponge and Boualem Benatallah and Fabio Casati and Farouk Toumani",
year = "2007",
language = "English",
isbn = "9783540755623",
volume = "4801 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "599--614",
booktitle = "Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings",

}

TY - GEN

T1 - Fine-grained compatibility and replaceability analysis of timed web service protocols

AU - Ponge, Julien

AU - Benatallah, Boualem

AU - Casati, Fabio

AU - Toumani, Farouk

PY - 2007

Y1 - 2007

N2 - We deal with the problem of automated analysis of web service protocol compatibility and replaceability in presence of timing abstractions, We first present a timed protocol model for services and identify different levels of compatibility and replaceability that are useful to support service development and evolution. Next, we present operators that can perform such analysis. Finally, we present operators properties by showing that timed protocols form a new class of timed automata, and we briefly present our implementation.

AB - We deal with the problem of automated analysis of web service protocol compatibility and replaceability in presence of timing abstractions, We first present a timed protocol model for services and identify different levels of compatibility and replaceability that are useful to support service development and evolution. Next, we present operators that can perform such analysis. Finally, we present operators properties by showing that timed protocols form a new class of timed automata, and we briefly present our implementation.

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

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

M3 - Conference contribution

SN - 9783540755623

VL - 4801 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 599

EP - 614

BT - Conceptual Modeling - ER 2007 - 26th International Conference on Conceptual Modeling, Proceedings

ER -