Results 1 
9 of
9
Bisimulation for higherorder process calculi
 INFORMATION AND COMPUTATION
, 1996
"... A higherorder process calculus is a calculus for communicating systems which contains higherorder constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e., the one for CCS and related calculi), ..."
Abstract

Cited by 64 (5 self)
 Add to MetaCart
A higherorder process calculus is a calculus for communicating systems which contains higherorder constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e., the one for CCS and related calculi), as well as higherorder bisimulation [E. Astesiano,
Authentication Primitives and Their Compilation
, 2000
"... Adopting a programminglanguage perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authentication and show how this calculus can be translated to a lowerlevel language using marshaling, multiplexing, and cryptog ..."
Abstract

Cited by 41 (13 self)
 Add to MetaCart
Adopting a programminglanguage perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authentication and show how this calculus can be translated to a lowerlevel language using marshaling, multiplexing, and cryptographic protocols. Authentication serves for identitybased security in the source language and enables simplifications in the translation. We reason about correctness relying on the concepts of observational equivalence and full abstraction.
Reversible communicating systems
 in: CONCUR’04, LNCS 3170 (2004
, 2004
"... Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past. 1
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
 ACM Transactions on Computational Logic
, 2002
"... 1. INTRODUCTION ST semantics, originally defined in [van Glabbeek and Vaandrager 1987] over Petri Nets, is one of the most studied noninterleaving semantics. The main reason is that ST semantics is the less informative semantics that is a congruence for ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
(Show Context)
1. INTRODUCTION ST semantics, originally defined in [van Glabbeek and Vaandrager 1987] over Petri Nets, is one of the most studied noninterleaving semantics. The main reason is that ST semantics is the less informative semantics that is a congruence for
A format for semantic equivalence comparison
, 2003
"... This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format di ers from most previous formats in that the labels on transitions are treated as manysorted terms. Bisimulation is a congruence for all ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format di ers from most previous formats in that the labels on transitions are treated as manysorted terms. Bisimulation is a congruence for all operators de ned by extended transition system speci cations in this format. When one extended transition system speci cation is summed with another, the resulting bisimulation can either identify more terms (an abstracting extension up to bisimulation) or fewer terms (a re ning extension up to bisimulation) than the original bisimulation on the individual system. The notions of abstracting extension and re ning extension are de ned, and two theorems are presented giving conditions required for achieving each type of extension. These results provide a way to compare di erent semantic equivalences de ned for di erent process algebras. Finally, an application of this theory to semantic equivalence comparison is given for a new result relating Castellani’s pomset equivalence and Krishnan’s multiprocessor equivalence.
Reversible Communicating Concurrent Systems
"... Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past. 1
Author manuscript, published in "CONCUR, Londres: United Kingdom (2004)" Reversible Communicating Systems
"... Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step ..."
Abstract
 Add to MetaCart
Abstract. One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past. hal00784051, version 1 3 Feb 2013 1
unknown title
"... Abstract Adopting a programminglanguage perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authentication and show how this calculus can be translated to a lowerlevel language using marshaling, multiplexing, an ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract Adopting a programminglanguage perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authentication and show how this calculus can be translated to a lowerlevel language using marshaling, multiplexing, and cryptographic protocols. Authentication serves for identitybased security in the source language and enables simplifications in the translation. We reason about correctness relying on the concepts of observational equivalence and full abstraction. 1 Authenticity from a programminglanguage perspective Establishing the origins and the destinations of messages is a common problem in distributed systems. When security matters, the solutions to the problem rely on sophisticated mechanisms such as authentication protocols, digital signatures, and encryption [25]. From the perspective of programming languages [28], we may rephrase the problem and its solutions in the following general terms: ffl First, we have a language with a primitive notion of principal and related operations. A principal may represent a location (e.g., an IP address) or an entity that owns that location (e.g., a user). A typical operation may enable the recipient of a message to determine the origin of the message. ffl A compiler implements those primitives by mapping them to security mechanisms. For example, principals of a source program may be associated with cryptographic keys in the corresponding target program. ffl The output of the compiler is lowerlevel code, written in a lowerlevel vocabulary that permits expressing \Lambda Part of this work was done at Compaq's Systems Research Center.