Analysis and applications of timed service protocols

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 an 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: C-Invoke constraints define time windows within which a service operation can be invoked while M-Invoke 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 identification of a novel class of timed automata, called protocol timed automata (PTA). Specifica...

• Type: Journal
• Year: 2010
• Where: TOSEM
• Authors: Julien Ponge, Boualem Benatallah, Fabio Casati, Farouk Toumani
• Keywords: Artificial Intelligence, Replaceability Analysis, TOSEM 2010, Web Service, Web Service Life-cycle