Verification of Web Services with Timed Automata

40Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we show how we can use formal methods for describing and analyzing the behavior of Web Services, and more specifically those including time restrictions. Then, our starting point are Web Services descriptions written in WSCI - WSCDL (XML-based description languages). These descriptions are then translated into timed automata, and then, we use a well known tool that supports this formalism (UPPAAL) to simulate and analyze the system behavior. As illustration we take a particular case study, a travel reservation system. © 2006 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Diaz, G., Pardo, J. J., Cambronero, M. E., Valero, V., & Cuartero, F. (2006). Verification of Web Services with Timed Automata. Electronic Notes in Theoretical Computer Science, 157(2 SPEC. ISS.), 19–34. https://doi.org/10.1016/j.entcs.2005.12.042

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free