A Timed Component Algebra for Services - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2013

A Timed Component Algebra for Services


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.
Fichier principal
Vignette du fichier
978-3-642-38592-6_17_Chapter.pdf (435.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01515250 , version 1 (27-04-2017)





Benoît Delahaye, José Luiz 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⟩
650 View
93 Download



Gmail Facebook X LinkedIn More