Abstract. This work studies the notion of locality in the context of process specication. It relates naturally with other works where infor-mation about the localities of a program is obtained information from its description written down in a programming language. This paper presents a new approach for this problem. In our case, the information about the system will be given in semantic terms using asyn-chronous transition systems. Given an asynchronous transition system we build an algebra of localities whose models are possible implementations of the known system. We present dierent results concerning the models for the algebra of localities. In addition, our approach neatly considers the relation of localities and non-determinism.
We present a simple extension of the ß-calculus with located actions and channels and with location ...
Abstract. We introduce spatial and epistemic process calculi for reasoning about spatial information...
Abstract. In this paper, we introduce a spatial and temporal logic for reason-ing about distributed ...
A new semantics for process description languages that discriminates according to the distribution i...
A general framework proposed by Degano, De Nicola and Montanari has been fruitful to define in a nat...
In this paper we investigate the issue of defining a programming calculus which supports programming...
We study a notion of observation for concurrent processes which allows the observer to see the distr...
AbstractIn an attempt to devise a general notion of model for spatial logic, we have been led to con...
We provide a simple non-interleaved operational semantics for CCS in terms of asynchronous transitio...
Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model th...
Abstract. We present locality-based abstractions, in which a set of states of a distributed system i...
AbstractProcess algebra semantics can be categorised into noninterleaving semantics, where parallel ...
Abstract. There is a growing need to introduce and develop computa-tional models capable of faithful...
AbstractWe introduce a refined version of observation for CCS which allows the observer to see the d...
Automated synthesis from behavioural specifications is an attractive way of constructing computation...
We present a simple extension of the ß-calculus with located actions and channels and with location ...
Abstract. We introduce spatial and epistemic process calculi for reasoning about spatial information...
Abstract. In this paper, we introduce a spatial and temporal logic for reason-ing about distributed ...
A new semantics for process description languages that discriminates according to the distribution i...
A general framework proposed by Degano, De Nicola and Montanari has been fruitful to define in a nat...
In this paper we investigate the issue of defining a programming calculus which supports programming...
We study a notion of observation for concurrent processes which allows the observer to see the distr...
AbstractIn an attempt to devise a general notion of model for spatial logic, we have been led to con...
We provide a simple non-interleaved operational semantics for CCS in terms of asynchronous transitio...
Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model th...
Abstract. We present locality-based abstractions, in which a set of states of a distributed system i...
AbstractProcess algebra semantics can be categorised into noninterleaving semantics, where parallel ...
Abstract. There is a growing need to introduce and develop computa-tional models capable of faithful...
AbstractWe introduce a refined version of observation for CCS which allows the observer to see the d...
Automated synthesis from behavioural specifications is an attractive way of constructing computation...
We present a simple extension of the ß-calculus with located actions and channels and with location ...
Abstract. We introduce spatial and epistemic process calculi for reasoning about spatial information...
Abstract. In this paper, we introduce a spatial and temporal logic for reason-ing about distributed ...