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.
|Title of host publication
|Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014.
|Number of pages
|Published - 2014
|Lecture Notes in Computer Science