In this paper we describe a technique to extend a process language such as CCS which does not model many aspects of distributed computation to one which does. The idea is to use a concept of location which represents a virtual node. Processes at different locations can evolve independently. Furthermore, communication between the processes at different locations occurs via explicit message passing. We extend CCS with locations and message passing primitives and present its operational semantics. We show that the equivalences induced by the new semantics and its properties are similar to the equivalences in CCS. We also show how the semantics of configuration and routing can be handled
AbstractWe propose a framework of distributed concurrent linear logic programming, which can elegant...
AbstractCoordination languages for parallel and distributed systems specify mechanisms for creating ...
. Nowadays, Computing systems accessible to researchers with "Grand Challenge" problems co...
A new semantics for process description languages that discriminates according to the distribution i...
AbstractWe present a model of distributed computation which is based on a fragment of the π-calculus...
AbstractWe introduce a refined version of observation for CCS which allows the observer to see the d...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
AbstractThis paper presents the formal specification of an abstract machine or the M-calculus, a new...
We propose an extension of concurrent constraint programming with primitives for process migration w...
A concurrent system is a collection of processors that communicate by reading and writing from a sha...
User explicitly distributes data User explicitly defines communication Compiler has to do no addit...
A new set of inference rules for the guarded version of Milner's Calculus of Communicating Systems ...
Today's distributed programs are often written using either explicit message passing or Remote Proce...
This paper gives the design of a programming model and environment for computations consisting of co...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
AbstractWe propose a framework of distributed concurrent linear logic programming, which can elegant...
AbstractCoordination languages for parallel and distributed systems specify mechanisms for creating ...
. Nowadays, Computing systems accessible to researchers with "Grand Challenge" problems co...
A new semantics for process description languages that discriminates according to the distribution i...
AbstractWe present a model of distributed computation which is based on a fragment of the π-calculus...
AbstractWe introduce a refined version of observation for CCS which allows the observer to see the d...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
AbstractThis paper presents the formal specification of an abstract machine or the M-calculus, a new...
We propose an extension of concurrent constraint programming with primitives for process migration w...
A concurrent system is a collection of processors that communicate by reading and writing from a sha...
User explicitly distributes data User explicitly defines communication Compiler has to do no addit...
A new set of inference rules for the guarded version of Milner's Calculus of Communicating Systems ...
Today's distributed programs are often written using either explicit message passing or Remote Proce...
This paper gives the design of a programming model and environment for computations consisting of co...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
AbstractWe propose a framework of distributed concurrent linear logic programming, which can elegant...
AbstractCoordination languages for parallel and distributed systems specify mechanisms for creating ...
. Nowadays, Computing systems accessible to researchers with "Grand Challenge" problems co...