Results 1  10
of
972
On bisimilarity and substitution in presence of replication
 In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6199 of LNCS
, 2010
"... Abstract. We prove a new congruence result for the picalculus: bisimilarity is a congruence in the subcalculus that does not include restriction nor sum, and features toplevel replications. Our proof relies on algebraic properties of replication, and on a new syntactic characterisation of bisi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
sation of bisimilarity. We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence. Whether bisimilarity is a congruence when replications are unrestricted remains open. 1
Author manuscript, published in "ICALP, Bordeaux: France (2010)" DOI: 10.1007/9783642141621_38 On Bisimilarity and Substitution in Presence of Replication ⋆ (extended version) ⋆⋆
, 2010
"... Abstract. We prove a new congruence result for the πcalculus: bisimilarity is a congruence in the subcalculus that does not include restriction nor sum, and features toplevel replications. Our proof relies on algebraic properties of replication, and on a new syntactic characterisation of bisimila ..."
Abstract
 Add to MetaCart
of bisimilarity. We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence. Whether bisimilarity is a congruence when replications are unrestricted remains open. 1
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more easily modelled. In this thesis a novel compositional approach to performance modelling is presented. This approach is based on a suitably enhanced process algebra, PEPA (Performance Evaluation Process Algebra). The compositional nature of the language provides benefits for model solution as well as model construction. An operational semantics is provided for PEPA and its use to generate an underlying Markov process for any PEPA model is explained and demonstrated. Model simplification and state space aggregation have been proposed as means to tackle the problems of large performance models. These techniques are presented in terms of notions of equivalence between modelling entities. A framewo...
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; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
Mobile Values, New Names, and Secure Communication
, 2001
"... We study the interaction of the "new" construct with a rich but common form of (firstorder) communication. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programminglanguage contexts. Specifically, we intro ..."
Abstract

Cited by 378 (18 self)
 Add to MetaCart
We study the interaction of the "new" construct with a rich but common form of (firstorder) communication. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programminglanguage contexts. Specifically, we introduce a simple, general extension of the pi calculus with value passing, primitive functions, and equations among terms. We develop semantics and proof techniques for this extended language and apply them in reasoning about some security protocols.
Weak bisimilarity coalgebraically
 In CALCO’09
, 2009
"... Abstract. We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illus ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We
Two Bisimilarities in νcalculus
"... We study two bisimilarities for νcalculus, a small but expressive formalism with asynchronous communication primitive. Weak bisimilarities based on two different notions of observables are formulated and studied. Both bisimilarities are congruence relations, while asynchronous bisimilarity i ..."
Abstract
 Add to MetaCart
We study two bisimilarities for νcalculus, a small but expressive formalism with asynchronous communication primitive. Weak bisimilarities based on two different notions of observables are formulated and studied. Both bisimilarities are congruence relations, while asynchronous bisimilarity
The Seal Calculus Revisited: contextual equivalence and bisimilarity
, 2003
"... We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related. ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related.
Tile Bisimilarity Congruences for Open Terms and Term Graphs
 in: Proc. CONCUR 2000, LNCS 1877 (2000
, 2000
"... The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open system specifications, the congruence is usually lifted from closed terms to open terms by instantiating the free variables in all possi ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open system specifications, the congruence is usually lifted from closed terms to open terms by instantiating the free variables in all
Some Congruence Properties for πcalculus Bisimilarities
, 1996
"... Both for interleaving and for noninterleaving semantics, several variants of a picalculus bisimilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simplest because it places no requi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Both for interleaving and for noninterleaving semantics, several variants of a picalculus bisimilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simplest because it places
Results 1  10
of
972