TY - BOOK
T1 - Compositional service trees
AU - Aalst, van der, W.M.P.
AU - Hee, van, K.M.
AU - Massuthe, P.
AU - Sidorova, N.
AU - Werf, van der, J.M.E.M.
PY - 2009
Y1 - 2009
N2 - 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 as-sume a static flattened model. In this paper we model a component byan open Petri net. We give a sufficient condition for proper completion (called soundness) that requires only pairwise checks of the service com-positions. We also provide a correctness-by-construction approach for building services trees.
AB - 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 as-sume a static flattened model. In this paper we model a component byan open Petri net. We give a sufficient condition for proper completion (called soundness) that requires only pairwise checks of the service com-positions. We also provide a correctness-by-construction approach for building services trees.
M3 - Report
T3 - Computer science reports
BT - Compositional service trees
PB - Technische Universiteit Eindhoven
CY - Eindhoven
ER -