I did a joint PhD (2004 – 2008) between Université Blaise Pascal (Clermont-Ferrand, France) and The University of New South Wales (Sydney, Australia), meaning that I obtained a PhD from each University.
My advisors where Pr. Farouk Toumani and Pr. Boualem Benatallah.
I obtained my French PhD (“Doctorat en Informatique de l’Université Blaise Pascal”) on July 1st 2008 with distinctions (“mention très honorable”). I defended my PhD thesis in front of:
- Pr. Marie-Christine FAUVET (President), Université Joseph Fourier / LIG, Grenoble, France
- Pr. Schahram DUSTDAR (Reviewer), Vienna University of Technology, Austria
- Pr. Claude GODART (Reviewer), Université Henry Poincaré / LORIA, Nancy, France
- Pr. Marlon DUMAS (Examiner), University of Tartu, Estonia & Queensland University of Technology, Brisbane, Australia
- Pr. Michel SCHNEIDER (Examiner), Université Blaise Pascal / LIMOS, Clermont-Ferrand, France
- Pr. Farouk TOUMANI (supervisor), Université Blaise Pascal / LIMOS, Clermont-Ferrand, France
- Pr. Boualem BENATALLAH (supervisor), University of New South Wales, Sydney, Australia
I obtained my Australian PhD (under cotutelle agreements) from the University of New South Wales in December 2008. The manuscript was accepted at the first round, without any modification request from the reviewers.
Model-based Analysis of Time-aware Web Services Interactions
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 the important category of protocols that include time-related constraints (called timed protocols), and the impact of time on compatibility and replaceability analysis.
We formalized the following timing constraints:
CInvoke constraints define time windows of availability while
MInvoke constraints define expirations 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 novel class of protocol timed automata (PTA). Specifically, PTA exhibit silent transitions that cannot be removed in general, 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.