Results 1  10
of
255,468
An Action Structure for Synchronous piCalculus
, 1993
"... After a review of relevant notions, an action structure is presented for the calculus. This yields a version of calculus which is synchronous in the sense of MEIJE or SCCS, i.e. an arbitrary amount of computation may take place in a single transition. The main new technical result is the constr ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
After a review of relevant notions, an action structure is presented for the calculus. This yields a version of calculus which is synchronous in the sense of MEIJE or SCCS, i.e. an arbitrary amount of computation may take place in a single transition. The main new technical result
Action Structures for the piCalculus
, 1993
"... In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action
Expressiveness of the piCalculus and the $Calculus
"... Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation. In ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation
Asynchrony and the PiCalculus
, 1992
"... We introduce an asynchronous version of Milner's ßcalculus, based on the idea that the messages are elementary processes that can be sent without any sequencing constraint. We show that this simple message passing discipline, together with the restriction construct making a name private for an ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
for an agent, is enough to encode the synchronous communication of the ßcalculus. 1. Introduction. The purpose of this note is to introduce an asynchronous variant of the ßcalculus of Milner, Parrow and Walker [8]. The ßcalculus is an extension of CCS, based on previous work by Engberg and Nielsen [5
Synchronizing Concurrent Objects in the piCalculus
, 1997
"... This report is organized as follows: in section 2 we introduce or #calculus object model followed by a description of McHale's "generic synchronization policies" in section 3. In section 4, we present the integration of the "generic synchronization policies" into our #calc ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
This report is organized as follows: in section 2 we introduce or #calculus object model followed by a description of McHale's "generic synchronization policies" in section 3. In section 4, we present the integration of the "generic synchronization policies" into our
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 112 (0 self)
 Add to MetaCart
by presenting a simple, structural type system for πcalculus, and then, after proving the soundness of our type system, show how to infer principal types for πterms. This simple type system can be extended to include useful typetheoretic constructions such as recursive types and higherorder polymorphism
Presheaf Models for the piCalculus
, 1997
"... Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the p ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
is the picalculus, a calculus for `mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the picalculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense
An Analysis of picalculus Bisimulations
, 1995
"... The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three ma ..."
Abstract
 Add to MetaCart
The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three
Timed Distributed picalculus
, 2006
"... We consider process algebras for modelling distributed systems with time constraints. For this task we must deal with access to resources, locations and interaction among processes. We extend the picalculus with locations, types and timers. Types are used to restrict the access to distributed res ..."
Abstract
 Add to MetaCart
We consider process algebras for modelling distributed systems with time constraints. For this task we must deal with access to resources, locations and interaction among processes. We extend the picalculus with locations, types and timers. Types are used to restrict the access to distributed
Results 1  10
of
255,468