From Design Formulas to Parallel Implementations

Abstract

In this paper we show how to construct a parallel implementation for a certain kind of design specifications [Rav95], whose formulas can define stability, framing, selection, and progress properties. The implementation is described as a parallel composition of timed automata with deadlines [SiY96], where one automaton can read clocks of the other automata in the parallel composition. The class of timed automata is closed under this parallel composition. The relationship between the design specifications of [Rav95] and timed automata is also investigated in [Lak96]. The constructions presented in [Lak96] result in one timed automaton, whereas our transformation will give a parallel implementation