A timed component algebra for services

Benoît Delahaye; José Luiz Fiadeiro; Axel Legay; Antónia Lopes

doi:10.1007/978-3-642-38592-6_17

A timed component algebra for services

Benoît Delahaye
, José Luiz Fiadeiro
, Axel Legay
, Antónia Lopes

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

56 Downloads (Pure)

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.

Original language	English
Title of host publication	FMOODS/FORTE
Editors	Dirk Beyer, Michele Borelae
Publisher	Springer
Pages	242-257
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-38592-6_17
Publication status	Published - 2013

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7892

Access to Document

10.1007/978-3-642-38592-6_17

paperAccepted author manuscript, 385 KB

Cite this

@inproceedings{83c84d9c938149da8193bb6adcaf3666,

title = "A timed component algebra for services",

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.",

author = "Beno{\^i}t Delahaye and Fiadeiro, \{Jos{\'e} Luiz\} and Axel Legay and Ant{\'o}nia Lopes",

year = "2013",

doi = "10.1007/978-3-642-38592-6\_17",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "242--257",

editor = "Dirk Beyer and Michele Borelae",

booktitle = "FMOODS/FORTE",

}

TY - GEN

T1 - A timed component algebra for services

AU - Delahaye, Benoît

AU - Fiadeiro, José Luiz

AU - Legay, Axel

AU - Lopes, Antónia

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-38592-6_17

DO - 10.1007/978-3-642-38592-6_17

M3 - Conference contribution

T3 - Lecture Notes in Computer Science

SP - 242

EP - 257

BT - FMOODS/FORTE

A2 - Beyer, Dirk

A2 - Borelae, Michele

PB - Springer

ER -