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

Documents

  • paper

    Accepted author manuscript, 526 KB, PDF-document

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.
Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.
PublisherSpringer
Pages115-132
Number of pages18
Volume8687
ISBN (Print)978-3-319-10881-0
DOIs
StatePublished - 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 22936143