Temporal Automata

We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the environment in which it operates, the wiring together of asynchronous automata, and the ability to aggregate individual machines to form one machine at a coarser level of granularity. We present the mathematical theory of temporal automata, and provide examples of applying the model. We then relate temporal automata to traditional constructs such as finite automata and Turing machines, as well as to more recent formalisms such as statecharts and situated automata. Finally, we briefly describe a formal language for defining temporal automata, a compiler for that language, and a simulator for the output of that compiler.