Skip to Main content Skip to Navigation
Theses

Decidability and complexity of simulation preorder for data-centric Web services

Abstract : In this thesis we address the problem of analyzing specifications of data-centric Web service interaction protocols (also called data-centric business protocols). Specifications of such protocols include data in addition to operation signatures and messages ordering constraints. Analysis of data-centric services is a complex task because of the inherently infinite states of the underlying service execution instances. Our work focuses on characterizing the problem of checking a refinement relation between service interaction protocol specifications. More specifically, we consider the problem of checking the simulation preorder when service business protocols are represented using data-centric state machines. First we study the Colombo model [BCG+05]. In this framework, a service (i) exchanges messages using variables; (ii) acts on a shared database; (iii) has a transition based behavior. We show that the simulation test for unbounded Colombo is undecidable. Then, we consider the case of bounded Colombo where we show that simulation is (i) exptime-complete for Colombo services without any access to the database (noted ColomboDB=∅), and (ii) 2exptime-complete when only bounded databases are considered (the obtained model is noted Colombobound). In the second part of this thesis, we define a generic model to study the impact of various parameters on the simulation test in the context of datacentric services. The generic model is a guarded transition system acting (i.e., read and write) on databases (i.e., local and shared) and exchanging messages with its environment (i.e., other services or users). The model was designed with a database theory perspective, where all actions are viewed as queries (i.e modification of databases, messages exchanges and guards). In this context, we obtain the following results (i) for update free guarded services (i.e., generic services with guards and only able to send empty messages) the decidability of simulation is fully characterized w.r.t decidability of satisfiability of the query language used to express the guards augmented with a restrictive form of negation, (ii) for update free send services (i.e., generic services without guards and able to send as messages the result of queries over local and shared database), we exhibit sufficient conditions for both decidability and undecidability of simulation test w.r.t the language used to compute messages payloads, and (iii) we study the case of insert services (i.e., generic services without guards and with the ability of insert the result of queries into the local and the shared database). In this case, we study the simulation as well as the weak simulation relations where we show that: (i) the weak simulation is undecidable when the insertions are expressed as conjunctive queries, (ii) the simulation is undecidable if satisfiability of the query language used to express the insertion augmented with a restricted form of negation is undecidable. Finally, we study the interaction between the queries used as guards and the ones used as insert where we exhibit a class of services where satisfiability of both languages is decidable while simulation is undecidable.
Document type :
Theses
Complete list of metadatas

Cited literature [52 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01155513
Contributor : Abes Star :  Contact
Submitted on : Tuesday, May 26, 2015 - 6:32:58 PM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM
Long-term archiving on: : Tuesday, September 15, 2015 - 6:56:18 AM

File

AKROUN_2014CLF22523.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01155513, version 1

Citation

Lakhdar Akroun. Decidability and complexity of simulation preorder for data-centric Web services. Other [cs.OH]. Université Blaise Pascal - Clermont-Ferrand II, 2014. English. ⟨NNT : 2014CLF22523⟩. ⟨tel-01155513⟩

Share

Metrics

Record views

591

Files downloads

468