Analysing timed compatibility of web service choreography
| Autor: | Maya Souilah Benabdelhafid, Mahmoud Boufaida, Béatrice Bérard |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
General Computer Science
Biometrics computer.internet_protocol Computer science Distributed computing Service choreography 020207 software engineering 02 engineering and technology Service-oriented architecture Petri net computer.software_genre CPN Tools 020204 information systems Compatibility (mechanics) 0202 electrical engineering electronic engineering information engineering Web service computer Global time |
| Zdroj: | International Journal of Critical Computer-Based Systems. 7:253 |
| ISSN: | 1757-8787 1757-8779 |
| DOI: | 10.1504/ijccbs.2017.10009398 |
| Popis: | Web services has become the most mature implementation of the service oriented computing (SOC) paradigm. The verification of behavioural compatibility is then necessary to ensure correct composition of services, which depends not only on qualitative properties such as absence of deadlock but also on some quantitative properties related to performance. Most of the proposed approaches verify the composition in service orchestration modelling. However, service choreography is more collaborative in nature and describes direct interactions between services. Although many existing approaches use Petri nets (PNs) and Colored PNs (CPNs) to analyse behavioural compatibility, few of them explore time constraints. We propose to model service interactions in a choreography with timed CPNs and perform automatic verification and simulation using CPN tools. We evaluate our approach with a case study from the Algerian e-Government, where we show how to verify global time constraints for the renewal of biometric passports. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|