Sciweavers

CONCUR
2012
Springer

Avoiding Shared Clocks in Networks of Timed Automata

12 years 1 months ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem when one considers implementing such model in a distributed architecture, since reading clocks a priori requires communications which are not explicitly described in the model. We focus on the following question: given a NTA A1 A2 where A2 reads some clocks reset by A1, does there exist a NTA A1 A2 without shared clocks with the same behavior as the initial NTA? For this, we allow the automata to exchange information during synchronizations only. We discuss a formalization of the problem and give a criterion using the notion of contextual timed transition system, which represents
Sandie Balaguer, Thomas Chatain
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where CONCUR
Authors Sandie Balaguer, Thomas Chatain
Comments (0)