Abstract Concurrent Constraint Programming (CCP) has been used over the last two
decades as an elegant and expressive model for concurrent systems. It models systems of …

Abstract Service Level Agreements are a key issue in Service Oriented Computing. SLA
contracts specify client requirements and service guarantees, with emphasis on Quality of …

The tcc model is a formalism for reactive concurrent constraint programming. We present a
model of temporal concurrent constraint programming which adds to tcc the capability of …

In higher-order process calculi, the values exchanged in communications may contain
processes. A core calculus of higher-order concurrency is studied; it has only the operators …

In this paper we investigate the expressive power of three alternative approaches to the
definition of infinite behaviours in process calculi, namely, recursive definitions, replication …

We investigate the expressive power of two alternative approaches used to express infinite
behaviours in process calculi, namely, replication and recursive definitions. These two …

In [BGZ03] we provided a discrimination result between recursive definitions and replication
in a fragment of CCS by showing that termination (ie, all computations terminate) is …

In this paper we shall survey and discuss in detail the work on the relative expressiveness of
recursion and replication in various process calculi. Namely, CCS, the pi-calculus, and the …

The timed concurrent constraint programing model (tcc) is a declarative framework, closely
related to First-Order Linear Temporal Logic (FLTL), for modeling reactive systems. The …

The ntcc process calculus is a timed concurrent constraint programming (ccp) model
equipped with a first-order linear-temporal logic (LTL) for expressing process specifications …