Heterogeneous Timed Machines

Benoit Delahaye (1) , J. L. Fiadeiro (2) , Axel Legay (3) , Antónia Lopes (4)

1 AELOS
2 Department of Computer Science
3 ESTASYS - Efficient STAtistical methods in SYstems of systems
4 Department of Informatics [Lisbon]

We present an algebra of discrete timed input/output au- tomata that execute in the context of different clock granularities -- timed machines -- as models of systems that can be dynamically inter- connected 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 feasi- ble. Finally, we investigate how consistency and feasibility of composition can be proved at run-time without computing products of automata.

Domaines: Théorie et langage formel [cs.FL]

Benoit Delahaye, J. L. Fiadeiro, Axel Legay, Antónia Lopes. Heterogeneous Timed Machines. 11th International Colloquium on Theoretical Aspects of Computing, Sep 2014, Bucharest, France. 18 p. ⟨hal-01010877⟩