Compositional Service Trees

  • Authors:

  • Wil M. Aalst;Kees M. Hee;Peter Massuthe;Natalia Sidorova;Jan Martijn Werf

  • Affiliations:

  • Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany 10099;Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

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.