A Timed Component Algebra for Services

Abstract : 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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01515250
Contributor : Hal Ifip <>
Submitted on : Thursday, April 27, 2017 - 10:46:53 AM
Last modification on : Wednesday, July 10, 2019 - 4:28:08 PM
Long-term archiving on : Friday, July 28, 2017 - 12:32:09 PM

File

978-3-642-38592-6_17_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Benoît Delahaye, José Fiadeiro, Axel Legay, Antónia Lopes. A Timed Component Algebra for Services. 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.242-257, ⟨10.1007/978-3-642-38592-6_17⟩. ⟨hal-01515250⟩

Share

Metrics

Record views

961

Files downloads

95