Heterogeneous Timed Machines. / Delahaye, Benoît; Fiadeiro, José Luiz; Legay, Axel; Lopes, Antónia.

Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.. Vol. 8687 Springer, 2014. p. 115-132 (Lecture Notes in Computer Science).

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

Published

Standard

Heterogeneous Timed Machines. / Delahaye, Benoît; Fiadeiro, José Luiz; Legay, Axel; Lopes, Antónia.

Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.. Vol. 8687 Springer, 2014. p. 115-132 (Lecture Notes in Computer Science).

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

Harvard

Delahaye, B, Fiadeiro, JL, Legay, A & Lopes, A 2014, Heterogeneous Timed Machines. in Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.. vol. 8687, Lecture Notes in Computer Science, Springer, pp. 115-132. https://doi.org/10.1007/978-3-319-10882-7_8

APA

Delahaye, B., Fiadeiro, J. L., Legay, A., & Lopes, A. (2014). Heterogeneous Timed Machines. In Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014. (Vol. 8687, pp. 115-132). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-319-10882-7_8

Vancouver

Delahaye B, Fiadeiro JL, Legay A, Lopes A. Heterogeneous Timed Machines. In Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.. Vol. 8687. Springer. 2014. p. 115-132. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-10882-7_8

Author

Delahaye, Benoît ; Fiadeiro, José Luiz ; Legay, Axel ; Lopes, Antónia. / Heterogeneous Timed Machines. Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.. Vol. 8687 Springer, 2014. pp. 115-132 (Lecture Notes in Computer Science).

BibTeX

@inproceedings{0db625f864604567b21a29677cec1493,
title = "Heterogeneous Timed Machines",
abstract = "We present an algebra of discrete timed input/output automata that execute in the context of different clock granularities - timed machines - as models of systems that can be dynamically interconnected at run time in a heterogeneous context. We show how timed machines can be refined to a lower granularity of time and how timed machines with different clock granularities can be composed. We propose techniques for checking whether timed machines are consistent or feasible. Finally, we investigate how consistency and feasibility of composition can be proved at run-time without computing products of automata.",
author = "Beno{\^i}t Delahaye and Fiadeiro, {Jos{\'e} Luiz} and Axel Legay and Ant{\'o}nia Lopes",
year = "2014",
doi = "10.1007/978-3-319-10882-7_8",
language = "English",
isbn = "978-3-319-10881-0",
volume = "8687",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "115--132",
booktitle = "Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.",

}

RIS

TY - GEN

T1 - Heterogeneous Timed Machines

AU - Delahaye, Benoît

AU - Fiadeiro, José Luiz

AU - Legay, Axel

AU - Lopes, Antónia

PY - 2014

Y1 - 2014

N2 - We present an algebra of discrete timed input/output automata that execute in the context of different clock granularities - timed machines - as models of systems that can be dynamically interconnected at run time in a heterogeneous context. We show how timed machines can be refined to a lower granularity of time and how timed machines with different clock granularities can be composed. We propose techniques for checking whether timed machines are consistent or feasible. Finally, we investigate how consistency and feasibility of composition can be proved at run-time without computing products of automata.

AB - We present an algebra of discrete timed input/output automata that execute in the context of different clock granularities - timed machines - as models of systems that can be dynamically interconnected at run time in a heterogeneous context. We show how timed machines can be refined to a lower granularity of time and how timed machines with different clock granularities can be composed. We propose techniques for checking whether timed machines are consistent or feasible. Finally, we investigate how consistency and feasibility of composition can be proved at run-time without computing products of automata.

U2 - 10.1007/978-3-319-10882-7_8

DO - 10.1007/978-3-319-10882-7_8

M3 - Conference contribution

SN - 978-3-319-10881-0

VL - 8687

T3 - Lecture Notes in Computer Science

SP - 115

EP - 132

BT - Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.

PB - Springer

ER -