Bisimulations for Asynchronous Mobile Processes

Hansen, Martin N.; Hüttel, Hans; Kleist, Josva

doi:10.7146/brics.v3i8.19971

Cited by 12 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, ground bisimilarity is a full congruence in the asynchronous π -calculus without match [17] (and a similar result holds for late and for early bisimilarity [8]), but this result does not hold if we consider the asynchronous π -calculus with polyadic synchronisation, as seen in Example 7. Matching does not need to be considered as a primitive in the π -calculus with polyadic synchronisation (synchronous or asynchronous) since it can be derived.…”

Section: Expressiveness Resultsmentioning

confidence: 86%

Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

Martinho

Ravara

2010

J Autom Reasoning

View full text Add to dashboard Cite

We thoroughly study the behavioural theory of epi, a π -calculus extended with polyadic synchronisation. We show that the natural contextual equivalence, barbed congruence, coincides with early bisimilarity, which is thus its co-inductive characterisation. Moreover, we relate early bisimilarity with the other usual notions, ground, late and open, obtaining a lattice of equivalence relations that clarifies the relationship among the "standard" bisimilarities. Furthermore, we apply the theory developed to obtain an expressiveness result: epi extended with key encryption primitives may be fully abstractly encoded in the original epi calculus. The proposed encoding is sound and complete with respect to barbed congruence; hence, cryptographic epi (crypto-epi) gets behavioural theory for free, which contrasts with other process languages with cryptographic constructs that usually require a big effort to develop such theory. Therefore, it is possible to use crypto-epi to analyse and to verify properties of security protocols using equational reasoning. To illustrate this claim, we prove compliance with symmetric and asymmetric cryptographic system laws, and the correctness of a protocol of secure message exchange.

show abstract

Section: Expressiveness Resultsmentioning

confidence: 86%

Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

Martinho

Ravara

2010

J Autom Reasoning

View full text Add to dashboard Cite

show abstract

“…~). In this section we discuss the extensions of our theory to the asynchronous variant of 7r-calculus [15,6,12,2] and to a version of asynchronous CCS of Section 2 with possibly non-injective relabelling.…”

Section: The Must Casementioning

confidence: 99%

“…The maximal congruence induced by completed trace equivalence has been studied in [9] for asynchronous ACP. Bisimulation [18] for asynchronous ~r-calculus has been investigated in [15,12,2].…”

Section: Introductionmentioning

confidence: 99%

“…This makes outputs non-blocking and immediately executable; their executions make messages available for consumption. The asynchronous variants of ~r-calculus [15,6,12,2] and CCS [21,11,8] follow the second approach and model outputs by creating new concurrent processes. This amounts to modelling an output prefix ~.P as a parallel composition a l PWork partially supported by EEC: HCM project EXPRESS, and by CNR: project "Specifica ad alto livello e verifica formale di sistemi digitali".…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous Observations of Processes

Boreale

Nicola

Pugliese

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study may and must testing-based preorders in an asynchronous setting. In particular, we provide some full abstraction theorems that offer alternative characterizations of these preorders in terms of context closure w.r.t, basic observables and in terms of traces and acceptance sets. These characterizations throw light on the asymmetry between input and output actions in asynchronous interactions and on the difference between synchrony and asynchrony. IntroductionDistributed systems can seldom rely on a global clock, and little assumptions can be made about their relative speed; as a consequence, it is natural to adopt for them an asynchronous communication mechanism. This calls for non-blocking sending primitives that do not oblige producers and consumers to synchronize when exchanging messages, but allow the sender of a message to continue with its task while the message travels to destination. Therefore, for describing distributed systems, a model based on a paradigm that imposes a neat distinction between input and output primitives, in the style of [1] and [17], appears to be a natural choice. In spite of these considerations, the most studied concurrency models in the process algebra community (e.g. [18,3,14,20]) are based on synchronous communications and model process interaction as the execution of simultaneous "complementary actions". Only recently, variants of process algebras based on asynchronous communications have been studied. Two main approaches have been followed to this purpose. They differ in the way (non-blocking) output actions are modelled. These actions are rendered either as state trans]ormers or as processes themselves. The asynchronous variants of ACP [9] and CSP [16] follow the first approach and introduce explicit buffers in correspondence of output channels. This makes outputs non-blocking and immediately executable; their executions make messages available for consumption. The asynchronous variants of ~r-calculus [15,6,12,2] and CCS [21,11,8] follow the second approach and model outputs by creating new concurrent processes. This amounts to modelling an output prefix ~.P as a parallel composition a l PWork partially supported by EEC: HCM project EXPRESS, and by CNR: project "Specifica ad alto livello e verifica formale di sistemi digitali". The third author has been supported by a scholarship from CNR --Comitato Scienza e Tecnologie dell'Informazione.

show abstract

A Theory of “May” Testing for Asynchronous Languages

Boreale¹,

Nicola²,

Pugliese³

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Asynchronous communication mechanisms are usually a basic ingredient of distributed systems and protocols. For these systems, asynchronous may-based testing seems to be exactly what is needed to capture safety and certain security properties. We study may testing equivalence focusing on the asynchronous versions of CCS and -calculus. We start from an operational testing preorder and provide nitary and fully abstract trace-based interpretations for it, together with complete inequational axiomatizations. The results throw l i g h t on the di erences between synchronous and asynchronous systems and on the weaker testing power of asynchronous observations.

show abstract

Bisimulations for Asynchronous Mobile Processes

Cited by 12 publications

References 18 publications

Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

Asynchronous Observations of Processes

A Theory of “May” Testing for Asynchronous Languages

Contact Info

Product

Resources

About