A Timed Concurrent Constraint Language

Abstract

We study a timed concurrent constraint language, called tccp, which is obtained by a natural timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next-time operator and the parallel execution of agents follows the scheduling policy of maximal parallelism. Additionally, tccp includes a simple primitive which allows one to… (More)
DOI: 10.1006/inco.1999.2879

Topics

2 Figures and Tables

Statistics

0510'02'04'06'08'10'12'14'16'18
Citations per Year

110 Citations

Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics