Compatibility between DAXML Schemas
Masson, Benoît, Loı̈c Hélouët, Albert Benveniste · INRIA a CCSD electronic archive server · 2011
A challenge in Web Services architectures is to compose basic services to obtain larger applications. Before using a service, a designer must ensure that it is compatible with the needs of the application. This means that inputs and outputs of the service comply with the intended ranges of data in the composite framework, but also that the service eventually returns a value. In this paper, we address the compatibility problem for modules described with Distributed Active XML (DAXML), a language for Web Services design. We first show that the behavior of non-recursive DAXML specifications with finite data can be represented as bounded labeled Petri nets. We then define compatibility of a DAXML service with some needs in terms of a home space property in the underlying Petri net. We use this result to define compatibility between DAXML modules, and prove its decidability. Finally, we give a faster semi-decision algorithm to verify compatibility between arbitrary sets of modules, without building the Petri net depicting the behavior of all modules.