Results 1  10
of
31,462
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
main contributions: (1) A characterization of `early' bisimulation in terms of a notion of `contextual' bisimulation. (2) The definition of a ßcalculus with explicit substitutions and the description of an abstract machine based on this notation which incrementally computes
A Theory of Bisimulation for the picalculus
, 1993
"... We study a new formulation of bisimulation for the calculus [MPW92], which we have called open bisimulation ( ). In contrast with the previously known bisimilarity equivalences, is preserved by all calculus operators, including input prefix. The differences among all these equivalences alread ..."
Abstract

Cited by 66 (0 self)
 Add to MetaCart
We study a new formulation of bisimulation for the calculus [MPW92], which we have called open bisimulation ( ). In contrast with the previously known bisimilarity equivalences, is preserved by all calculus operators, including input prefix. The differences among all these equivalences
Symbolic bisimulation for the applied picalculus
 In Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’07), volume 4855 of Lecture Notes in Computer Science
, 2007
"... We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs fro ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
that the symbolic bisimulation relation is sufficient for many practical examples. This work is an important step towards automation of observational equivalence for the finite applied pi calculus, e.g. for verification of anonymity or strong secrecy properties.
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
. Higherorder polymorphism is important, since it gives us the ability to implement abstract datatypes in a typesafe manner, thereby providing a greater degree of modularity for πcalculus programs. The functional computational paradigm plays an important part in many programming languages. It is well
Computing Bisimulations for FiniteControl πCalculus
, 2000
"... Symbolic bisimulation avoids the infinite branching problem caused by instantiating input names with all names in the standard definition of bisimulation in the πcalculus. However, it does not automatically lead to an efficient algorithm, because symbolic bisimulation is indexed by conditions on ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
symbolic bisimulation in a precise sense. Based on the new definition an efficient algorithm, which instantiate input names "onthefly", is presented to check bisimulations for finitecontrol πcalculus.
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
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
On Bisimulations for the Asynchronous πcalculus
, 1996
"... The asynchronous picalculus is a variant of the picalculus where message emission is nonblocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input acti ..."
Abstract

Cited by 56 (1 self)
 Add to MetaCart
The asynchronous picalculus is a variant of the picalculus where message emission is nonblocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input
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
Results 1  10
of
31,462