We consider a timed extension of conceurrent constraint programming, called teccp. For this lagnuage we define a denotational model which is fully abstract wrt the standard notion of observables (input-output pairs). We also define a fully abstract semantics for a sublanguage of tccp, called ccpx, which essentially is s tandard conceurrent costraint programming (ccp), provide that we interpret the parallel operator in terms of "maximal parallelism" ratoher than of interleaving. Finally we compare the exprressive power of these languages. We show that tccp is s tricity more expressive than ccpx which, in its turn, is strictly more expressive than ccp.
展开▼
