Compositional Service Trees

9 years 10 months ago
Compositional Service Trees
In the world of Service Oriented Architectures, one deals with networks of cooperating components. A component offers services; to deliver a service it possibly needs services of other components, thus forming a service tree. This tree is built dynamically and not known beforehand. It is hard to verify the behavior of a service tree by using standard verification techniques, because these techniques typically assume a static flattened model. In this paper we model a component by an open Petri net. We give a sufficient condition for proper completion (called soundness) that requires only pairwise checks of the service compositions. We also provide a correctness-by-construction approach for building services trees.
Wil M. P. van der Aalst, Kees M. van Hee, Peter Ma
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where APN
Authors Wil M. P. van der Aalst, Kees M. van Hee, Peter Massuthe, Natalia Sidorova, Jan Martijn E. M. van der Werf
Comments (0)