Abstract
We present a component algebra for services that can guar-
antee time-related properties. The components of this algebra are net-
works of processes that execute according to time constraints and com-
municate asynchronously through channels that can delay messages. We
characterise a sub-class of consistent networks give sucient 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.
antee time-related properties. The components of this algebra are net-
works of processes that execute according to time constraints and com-
municate asynchronously through channels that can delay messages. We
characterise a sub-class of consistent networks give sucient 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.
| Original language | English |
|---|---|
| Title of host publication | FMOODS/FORTE |
| Editors | Dirk Beyer, Michele Borelae |
| Publisher | Springer |
| Pages | 242-257 |
| Number of pages | 16 |
| DOIs | |
| Publication status | Published - 2013 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 7892 |