Results 1  10
of
18,202
A Distribution Law for CCS and a New Congruence Result for the Picalculus
 LMCS
"... Abstract. We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite πcalculus in absence of sum. To our knowledge, this is the only nontrivial subcalc ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite πcalculus in absence of sum. To our knowledge, this is the only nontrivial
Stochastic PiCalculus Revisited
"... Abstract. We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space of processes ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space
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
congruence for the calculus. The main purpose of this paper is to give a family of action structures for the calculus. Using one of these, the original calculus is obtained by the uniform construction. The most substantial technical element here is the construction of an appropriate incident set
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
Multiaction $\pi$calculus
"... We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus. ..."
Abstract
 Add to MetaCart
We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus
Multisets and Structural Congruence of the piCalculus with Replication
 Theoretical Computer Science
, 1995
"... . In the ßcalculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system Mß. It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable. 1 Introduction A particularly elegant ver ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
. In the ßcalculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system Mß. It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable. 1 Introduction A particularly elegant
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
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
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
Results 1  10
of
18,202