A Theory of Service Dependency
Logic in Computer Science
2016-06-08 v1
Abstract
Service composition has become commonplace nowadays, in large part due to the increased complexity of software and supporting networks. Composition can be of many types, for instance sequential, prioritising, non-deterministic. However, a fundamental feature of the services to be composed consists in their dependencies with respect to each other. In this paper we propose a theory of service dependency, modelled around a dependency operator in the Action Systems formalism. We analyze its properties, composition behaviour, and refinement conditions with accompanying examples.
Cite
@article{arxiv.1606.02024,
title = {A Theory of Service Dependency},
author = {Mats Neovius and Luigia Petre and Kaisa Sere},
journal= {arXiv preprint arXiv:1606.02024},
year = {2016}
}
Comments
In Proceedings Refine'15, arXiv:1606.01344