Results 1  10
of
11,527
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
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
Stochastic PiCalculus With General Distributions
 in Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT
, 1996
"... In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used
ISSN Timed Distributed picalculus by
, 2006
"... Approved for public release; further dissemination unlimited. ..."
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
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
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
compositional proof system is given with the scope of verifying dynamic networks of picalculus agents against properties specified in this logic. The proof system consists of a local part based, roughly, on the classical sequent calculus extended with data structures for private names, and rules to support
An Extension to PiCalculus for Performance Evaluation
"... PiCalculus is a formal method for describing and analyzing the behavior of large distributed and concurrent systems. Picalculus offers a conceptual framework for describing and analyzing the concurrent systems whose configuration may change during the computation. With all the advantages that pic ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
place internally in a system. By using such parameters, the designers can benchmark multiprocess systems and compare the performance of different architectures against one another. Keywords: Picalculus, Performance Evaluation, MultiAgent Systems, System Modeling 1.
A Translation of the PiCalculus into MONSTR
 J.UCS
, 1995
"... A translation of the πcalculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the πcalculus and similar process calculi. It also illustrates the convenience ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
A translation of the πcalculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the πcalculus and similar process calculi. It also illustrates the convenience
Occurrence Counting Analysis for the piCalculus
, 2001
"... We propose an abstract interpretationbased analysis for automatically proving nontrivial properties of mobile systems of processes. We focus on properties relying on the number of occurrences of processes during computation sequences, such as mutual exclusion and nonexhaustion of resources. We de ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
design a nonstandard semantics for the picalculus in order to explicitly trace the origin of channels and to solve efficiently problems set by alphaconversion and nondeterministic choices. We abstract this semantics into an approximate one. The use of a relational domain for counting the occurrences
Results 1  10
of
11,527