(2014) 11th International Colloquium on Theoretical Aspects of Computing (17.September.2014)
Files
No attached file found for this publication.
Details
Authors
Delahaye, Benoit
Author
Fiadeiro J., L.
Author
Legay, AxelUCLouvain
Author
Lopes, Antónia
Author
Abstract
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.
Delahaye, B., Fiadeiro J., L., Legay, A., & Lopes, A. (2014). Heterogeneous Timed Machines. 11th International Colloquium on Theoretical Aspects of Computing. https://hdl.handle.net/2078.5/172993