Results 1  10
of
18
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen, who added mobility to CCS while preserving its algebraic properties. The rrcalculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names, and computation is represented purely as the communication of names across links. After an illustrated description of how the ncalculus generalises conventional process algebras in treating mobility, several examples exploiting mobility are given in some detail. The important examples are the encoding into the ncalculus of higherorder functions (the Icalculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctionsi.e., assumptions of inequality among names. These theories are based upon a semantics in terms of a labeled transition system and a notion of strong bisimulation, both of which are expounded in detail in a companion paper. We also report briefly on workinprogress based upon the corresponding notion of weak bisimulation, in which internal actions cannot be observed.
A Calculus of Mobile Processes, Part I
 I AND II. INFORMATION AND COMPUTATION
, 1989
"... We present the ßcalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 219 (4 self)
 Add to MetaCart
We present the ßcalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen who added mobility to CCS while preserving its algebraic properties. The ßcalculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names, and computation is represented purely as the communication of names across links. After an illustrated description of how the ßcalculus generalises conventional process algebras in treating mobility, several examples exploiting mobility are given in some detail. The important examples are the encoding into the ß calculus of higherorder functions (the calculus and combinatory algebra), the tr...
An Asynchronous Model of Locality, Failure, and Process Mobility
 THEORETICAL COMPUTER SCIENCE
, 1997
"... We present a model of distributed computation which is based on a fragment of the picalculus relying on asynchronous communication. We enrich the model with the following features: the explicit distribution of processes to locations, the failure of locations and their detection, and the mobility of ..."
Abstract

Cited by 116 (4 self)
 Add to MetaCart
We present a model of distributed computation which is based on a fragment of the picalculus relying on asynchronous communication. We enrich the model with the following features: the explicit distribution of processes to locations, the failure of locations and their detection, and the mobility of processes. Our contributions are two folds. At the specification level, we give a synthetic and flexible formalization of the features mentioned above. At the verification level, we provide original methods to reason about the bisimilarity of processes in the presence of failures.
A Calculus of Communicating Systems with Label Passing
, 1986
"... This report is essential Uffe Engbergs thesis for the MSc degree from Department of Computer Science, Aarhus University except that all proofs of theorems have been left out. Should anyone have interest in particular proofs, they may be obtained by contacting one of the authors. 1 Introduction ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
(Show Context)
This report is essential Uffe Engbergs thesis for the MSc degree from Department of Computer Science, Aarhus University except that all proofs of theorems have been left out. Should anyone have interest in particular proofs, they may be obtained by contacting one of the authors. 1 Introduction
Programming with behaviors in an ML framework  The syntax and semantics of LCS
, 1994
"... LCS is an experimental high level asynchronous parallel programming language primarily aimed at exploring design, implementation and use of programming languages based upon the behavioral paradigms introduced by CSP and CCS. The language extends Standard ML with primitives for concurrency and com ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
LCS is an experimental high level asynchronous parallel programming language primarily aimed at exploring design, implementation and use of programming languages based upon the behavioral paradigms introduced by CSP and CCS. The language extends Standard ML with primitives for concurrency and communication based upon a higher order extension of the CCS formalism. Typechecking enforces consistency of communications. An abstract operational semantics of the language is given in terms of a transition system.
A Filter Model for Concurrent λCalculus
 SIAM J. COMPUT
, 1998
"... Type free lazy λcalculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union ty ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Type free lazy λcalculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types and we prove that the induced logical semantics is fully abstract.
On the Bisimulation Theory and Axiomatization of Higherorder Process Calculi
"... Higherorder process calculi, for its abstraction capability and theoretical significance, have constantly been receiving much attention in the field of process calculi, and stand as a mathematical tool for describing and analyzing mobile systems with dynamically changing interconnection structures ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Higherorder process calculi, for its abstraction capability and theoretical significance, have constantly been receiving much attention in the field of process calculi, and stand as a mathematical tool for describing and analyzing mobile systems with dynamically changing interconnection structures. In this thesis we contribute to the higherorder paradigm in several aspects. • Higherorder πcalculus with mismatch: the bisimulation theory. Linear fragment of higherorder πcalculus with mismatch: the axiomatization. The problem of the axiomatization of higherorder process calculi, such as higherorder πcalculus, is always a nontrivial one. However, it is important, both in theory and practice, to be able to decide whether two higherorder processes are equivalent with respect to some bisimulation, which needs an algorithm that can effectively analyze and give an answer efficiently. We further the available work by considering the higherorder πcalculus with mismatch, which is a useful operator in bisimulation theory and especially the axiomatization, from algorithmic point of view. We first formulate the bisimulation theory, where the bisimulation we define is called open weak higherorder bisimulation, which is a nondelayed