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: Book/ReportReportAcademic

29 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 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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Publication statusPublished - 2009

Publication series

NameComputer science reports
Volume0901
ISSN (Print)0926-4515

Fingerprint

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

Cite this