We present a component algebra for services that can guarantee time-related properties. The components of this algebra are networks of processes that execute according to time constraints and communicate asynchronously through channels that can delay messages. We characterise a sub-class of consistent networks give sufficient conditions for that class to be closed under composition. Finally, we show how those conditions can be checked, at design time, over timed I/O automata as orchestrations of services, thus ensuring that, when binding a client with a supplier service at run time, the orchestrations of the two services can work together as interconnected without further checks. © 2013 IFIP International Federation for Information Processing.
CITATION STYLE
Delahaye, B., Fiadeiro, J. L., Legay, A., & Lopes, A. (2013). A timed component algebra for services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7892 LNCS, pp. 242–257). https://doi.org/10.1007/978-3-642-38592-6_17
Mendeley helps you to discover research relevant for your work.