On the expressiveness of Timed Concurrent Constraint Programming

Abstract

We prove that both the synchronous data flow language Lustre restricted to finite value types and the synchronous state oriented language Argos are embedded in the synchronous paradigm Timed Concurrent Constraint (tcc). In fact, for each of the two languages we provide a tcc language encoding it compositionally w.r. to the structure of programs. Moreover, we prove that the “strong abortion” mechanism of the synchronous imperative language Esterel can be encoded in tcc.