Distributed Timed Automata
Padmanabhan Krishnan · Electronic Notes in Theoretical Computer Science · 2000
In this article we discuss (i) a model suitable for describing a distributed real-time system and (ii) a notion of implementation for such systems on a uniprocessor system. The first point is addressed by amalgamating finite state automata with dense time (or Alur-Dill automata) and asynchronous distributed (or Zielonka) automata over a distributed alphabet. The second point is addressed by defining the process of interleaving and time slicing.