A timed component algebra for services. / Delahaye, Benoît; Fiadeiro, José Luiz; Legay, Axel; Lopes, Antónia.

FMOODS/FORTE. ed. / Dirk Beyer; Michele Borelae. Springer, 2013. p. 242-257 (Lecture Notes in Computer Science; Vol. 7892).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Standard

A timed component algebra for services. / Delahaye, Benoît; Fiadeiro, José Luiz; Legay, Axel; Lopes, Antónia.

FMOODS/FORTE. ed. / Dirk Beyer; Michele Borelae. Springer, 2013. p. 242-257 (Lecture Notes in Computer Science; Vol. 7892).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Delahaye, B, Fiadeiro, JL, Legay, A & Lopes, A 2013, A timed component algebra for services. in D Beyer & M Borelae (eds), FMOODS/FORTE. Lecture Notes in Computer Science, vol. 7892, Springer, pp. 242-257. https://doi.org/10.1007/978-3-642-38592-6_17

APA

Delahaye, B., Fiadeiro, J. L., Legay, A., & Lopes, A. (2013). A timed component algebra for services. In D. Beyer, & M. Borelae (Eds.), FMOODS/FORTE (pp. 242-257). (Lecture Notes in Computer Science; Vol. 7892). Springer. https://doi.org/10.1007/978-3-642-38592-6_17

Vancouver

Delahaye B, Fiadeiro JL, Legay A, Lopes A. A timed component algebra for services. In Beyer D, Borelae M, editors, FMOODS/FORTE. Springer. 2013. p. 242-257. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-38592-6_17

Author

Delahaye, Benoît ; Fiadeiro, José Luiz ; Legay, Axel ; Lopes, Antónia. / A timed component algebra for services. FMOODS/FORTE. editor / Dirk Beyer ; Michele Borelae. Springer, 2013. pp. 242-257 (Lecture Notes in Computer Science).

BibTeX

@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. Wecharacterise a sub-class of consistent networks give sucient conditionsfor that class to be closed under composition. Finally, we show how thoseconditions can be checked, at design time, over timed I/O automata asorchestrations of services, thus ensuring that, when binding a client witha supplier service at run time, the orchestrations of the two services canwork 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",

}

RIS

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. Wecharacterise a sub-class of consistent networks give sucient conditionsfor that class to be closed under composition. Finally, we show how thoseconditions can be checked, at design time, over timed I/O automata asorchestrations of services, thus ensuring that, when binding a client witha supplier service at run time, the orchestrations of the two services canwork 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. Wecharacterise a sub-class of consistent networks give sucient conditionsfor that class to be closed under composition. Finally, we show how thoseconditions can be checked, at design time, over timed I/O automata asorchestrations of services, thus ensuring that, when binding a client witha supplier service at run time, the orchestrations of the two services canwork 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 -