2012
Model-Checking Web Services Business Activity Protocols
MARQUES, Abinoam P.; Andres P. RAVN; Jiří SRBA a Saleem VIGHIOZákladní údaje
Originální název
Model-Checking Web Services Business Activity Protocols
Autoři
MARQUES, Abinoam P.; Andres P. RAVN; Jiří SRBA a Saleem VIGHIO
Vydání
International Journal on Software Tools for Technology Transfer (STTT), 2012, 1433-2779
Další údaje
Jazyk
angličtina
Typ výsledku
Článek v odborném periodiku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Nizozemské království
Utajení
není předmětem státního či obchodního tajemství
Odkazy
Označené pro přenos do RIV
Ano
Kód RIV
RIV/00216224:14330/12:00062432
Organizační jednotka
Fakulta informatiky
Klíčová slova anglicky
web services; verification; timed automata
Změněno: 23. 4. 2013 09:38, RNDr. Pavel Šmerk, Ph.D.
Anotace
V originále
Web Services Business Activity specification defines two coordination protocols BAwCC (Business Agreement with Coordination Completion) and BAwPC (Business Agreement with Participant Completion)that ensure a consistent agreement on the outcome of long-running distributed applications. In order to verify fundamental properties of the protocols we provide formal analyses in the model checker UPPAAL.Our analyses are supported by a newly developed tool chain,where in the first step we translatetables with state-transition protocol descriptionsinto an intermediate XML format, and in the second step we translate this format into a network of communicating state machines directly suitable for verification in UPPAAL.Our results show that the WS-BA protocols, as described in the standard specification, violate correct operation by reaching invalid statesfor all underlying communication media except for a perfect FIFO. Hence we propose changes to the protocols and a further investigation of the modified protocols suggests that in case of the BAwCC protocol messages should be received in the same order as they are sent to preserve correct behaviour,while BAwPC is now correct even for asynchronous,unordered, lossy and duplicating media.Another important property of communication protocols is that all parties always reach, under certain fairness assumptions, their final states. Based on an automatic verification with different communication models, we prove that our enhanced protocols satisfy this property whereas the original protocols do not.All verification results presented in this article were performedin a fully automatic way using our new tool csv2uppaal.
Návaznosti
| LA09016, projekt VaV |
|