A Timed Component Algebra for Services
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...
