Heterogeneous Timed Machines
Résumé
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]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...