Results 1  10
of
9,136
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
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.
On the Reduction of Chocs Bisimulation to πcalculus Bisimulation
, 1995
"... Chocs and πcalculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of an emb ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Chocs and πcalculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means
Open Bisimulation for the Concurrent Constraint Picalculus ⋆
"... Abstract. The concurrent constraint picalculus (ccpicalculus) has been introduced as a model for concluding Service Level Agreements. The ccpi calculus combines the synchronous communication paradigm of process calculi with the constraint handling mechanism of concurrent constraint programming. ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
. While in the original presentation of the calculus a reduction semantics has been proposed, in this work we investigate the abstract semantics of ccpi processes. First, we define a labelled transition system of the calculus and a notion of open bisimilarity à la picalculus that is proved to be a
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
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
Branching Time and Abstraction in Bisimulation Semantics
 Journal of the ACM
, 1996
"... Abstract. In comparative concurrency semantics, one usually distinguishes between linear time and branching time semantic equivalences. Milner’s notion of ohsen~ation equirlalence is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observa ..."
Abstract

Cited by 322 (17 self)
 Add to MetaCart
, in the sense that it preserves computations together with the potentials in all intermediate states that are passed through, even if silent moves are involved. On closed KSterms branching bisimulation congruence can be completely axiomatized by the single axiom scheme: a.(7.(y + z) + y) = a.(y + z) (where a
From HigherOrder piCalculus to piCalculus in the Presence of Static Operators
, 1998
"... . Some applications of higherorder processes require better control of communication capabilities than what is provided by the ß calculus primitives. In particular we have found the dynamic restriction operator of CHOCS, here called blocking, useful. We investigate the consequences of adding stat ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
. Some applications of higherorder processes require better control of communication capabilities than what is provided by the ß calculus primitives. In particular we have found the dynamic restriction operator of CHOCS, here called blocking, useful. We investigate the consequences of adding
Results 1  10
of
9,136