The following discrimination result is proved between replication and recursive definitions: the termination of processes is an undecidable property in the core of CCS, provided that recursive process definitions are allowed, while termination turns out to be decidable when only replication is permitted.Expand
The main result of this paper is the definition of an effective procedure that can be used to verify whether a service with a given contract can correctly play a specific role within a choreography.Expand
A process algebra containing the coordination primitives of Linda is introduced, showing that there exists a deadlock-preserving simulation of such nets by finite P/T nets, a formalism where termination is decidable.Expand
A lattice of eight languages is proposed, where its bottom element L is a process algebra differing from CCS only for the asynchrony of the output operation, while all the other languages in the lattice are obtained as extension of this basic language by adding some of the Linda coordination primitives.Expand
A complete picture of the decidability boundaries of decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement according to different assumptions on communication graphs, namely static, mobile, and bounded path topology is drawn.Expand
This work extends the results in [BGZ03] by considering iteration, a third mechanism for expressing infinite behaviours, and shows that convergence (i.e., the existence of a terminating computation) is undecidable in the calculus with replication, whereas it is decidable inthe calculus with iteration.Expand
This paper designs an extension of the asynchronous π-calculus with long-running transactions (and sequences) – the πt -calculus, by defining a semantics and providing a correct encoding of ρt-Calculus into asynchronous ρ-cal calculus.Expand
This work considers several interpretations for interaction-oriented choreographies spanning from synchronous to asynchronous communication, and formalizes the notion of equivalence between the initial interaction- oriented choreography and the corresponding process-oriented one.Expand
This study introduces SCC, a process calculus that features explicit notions of service definition, service invocation and session handling, and presents syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives.Expand
This work proposes a new theory of contracts which also addresses the problem of composition of multiple services (not only one client with one service) and shows that a compliant group of contracts is still compliant if every contract is replaced by one of its subcontracts.Expand