@inbook{581481e4f3c24a4aa32e046d10df7164,
title = "Compositional service trees",
abstract = "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.",
author = "\{Aalst, van der\}, W.M.P. and \{Hee, van\}, K.M. and P. Massuthe and N. Sidorova and \{Werf, van der\}, J.M.E.M.",
year = "2009",
doi = "10.1007/978-3-642-02424-5\_17",
language = "English",
isbn = "978-3-642-02423-8",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "283--302",
editor = "G. Franceschinis and K. Wolf",
booktitle = "Applications and Theory of Petri Nets (30th International Conference, Petri Nets 2009, Paris, France, June 22-26, 2009, Proceedings)",
address = "Germany",
}