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 service description should include not only the interface, but also business protocol supported by service. The present work focuses on formalization of an important category protocols includes time-related constraints (called timed protocols), impact time compatibility replaceability analysis. We formalized following timing constraints: C-Invoke define windows which operation can be invoked while M-Invoke expiration deadlines. extended techniques analysis between using semantic-preserving mapping automata, leading to identification novel class called automata (PTA). PTA exhibit particular kind silent transition strictly increase expressiveness model, yet they closed under complementation, making every type or decidable. Finally, we implemented our approach in context larger project ServiceMosaic, model-driven life-cycle management.