Results 1  10
of
67,512
On the Expressive Power of Polyadic Synchronisation in πCalculus
, 2002
"... We extend the picalculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of picalculus, we suggest that it permits divergencefree encodings of distributed calculi, and ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
, and we show that a limited form of polyadic synchronisation can be encoded weakly in picalculus. After showing that matching cannot be derived in picalculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation of a
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
Proof Systems for piCalculus Logics
, 2001
"... In this paper we study the problem of verifying general temporal and functional properties of mobile and dynamic process networks, cast in terms of the picalculus. Much of the expressive power of this calculus derives from the combination of name generation and communication (to handle mobility ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
In this paper we study the problem of verifying general temporal and functional properties of mobile and dynamic process networks, cast in terms of the picalculus. Much of the expressive power of this calculus derives from the combination of name generation and communication (to handle
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
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
On the Decidability of Process Equivalences for the picalculus
, 1994
"... We present general results for showing process equivalences applied to the finite control fragment of the ßcalculus decidable. Firstly a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Sec ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We present general results for showing process equivalences applied to the finite control fragment of the ßcalculus decidable. Firstly a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite
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
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
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
, 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract

Cited by 601 (41 self)
 Add to MetaCart
the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe
On the Expressive Power of Polyadic . . .
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2002
"... We extend the #calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of #calculus, and makes it possible to derive divergencefree encodings of distributed calculi. ..."
Abstract
 Add to MetaCart
We extend the #calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of #calculus, and makes it possible to derive divergencefree encodings of distributed calculi
Results 1  10
of
67,512