Heterogeneous timed machines

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

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

2 Citations (Scopus)


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
Subtitle of host publication11th International Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings
EditorsGabriel Ciobanu, Dominique Méry
Place of PublicationSwitzerland
Number of pages18
ISBN (Electronic)9783319108827
ISBN (Print)9783319108810
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Time Machine
  • Reachable State
  • Heterogeneous Composition
  • Joint Behaviour
  • Partial Execution

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Heterogeneous timed machines'. Together they form a unique fingerprint.

Cite this