Compositional service trees

W.M.P. Aalst, van der, K.M. Hee, van, P. Massuthe, N. Sidorova, J.M.E.M. Werf, van der

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

22 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationApplications and Theory of Petri Nets (30th International Conference, Petri Nets 2009, Paris, France, June 22-26, 2009, Proceedings)
EditorsG. Franceschinis, K. Wolf
Place of PublicationBerlin
PublisherSpringer
Pages283-302
ISBN (Print)978-3-642-02423-8
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5606

Fingerprint

Dive into the research topics of 'Compositional service trees'. Together they form a unique fingerprint.

Cite this