## Deriving structural labelled transitions for mobile ambients (2008)

### Cached

### Download Links

- [users.ecs.soton.ac.uk]
- [users.ecs.soton.ac.uk]
- [users.ecs.soton.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 15 - 2 self |

### BibTeX

@MISC{Rathke08derivingstructural,

author = {Julian Rathke},

title = {Deriving structural labelled transitions for mobile ambients},

year = {2008}

}

### OpenURL

### Abstract

Abstract. We present a new labelled transition system (lts) for the ambient calculus on which ordinary bisimilarity coincides with contextual equivalence. The key feature of this lts is that it is the fruit of ongoing work on developing a systematic procedure for deriving ltss in the structural style from the underlying reduction semantics and observability. Notably, even though we have derived our lts for ambients systematically it compares very favourably with existing transition systems for the same calculus.

### Citations

3427 | Communicating sequential processes
- Hoare
- 1978
(Show Context)
Citation Context ...ts for ambients systematically it compares very favourably with existing transition systems for the same calculus. Introduction Since the introduction of the archetypal process calculi, CCS [19], CSP =-=[13]-=- and ACP [2], and the π-calculus [19] some years ago there has been a proliferation of calculus extensions and variants which address assorted computational features. One concern that is often voiced ... |

1342 |
A Calculus of Communicating Systems
- Milner
- 1982
(Show Context)
Citation Context ...ervability. Key words: labelled transition systems (lts), structural operational semantics (sos), ambient calculus, bisimulation Introduction Since the introduction of archetypal process calculi (CCS =-=[21]-=-, CSP [15], ACP [2] and the π-calculus [10, 22]) there has been a proliferation of new languages, extensions and assorted variants of earlier calculi. Each addresses some computational feature and/or ... |

1288 | A Structural Approach to Operational Semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...scribe and reason with. It is easy to lose sight of the fact that the original intention of labelled transition systems was to provide an inductive definition of the reduction relation for a language =-=[21]-=-. Their subsequent use as points of comparison of interaction in bisimulation equivalences has allowed focus to drift away from inductively defined labelled transition systems and on to labels as the ... |

1001 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...ed on term-rewriting [23] as applied to the ambient calculus. We note that this work already suggests using (non-inductive versions of) our rules (In), (Out), and (Open). Similarly, Jensen and Milner =-=[15]-=- use the context-as-labels approach to provide a derived lts for the ambient calculus via an encoding to bigraphs. This lts is also non-inductive and the lack of a detailed analysis of the resulting R... |

811 | Mobile Ambients
- Cardelli, Gordon
(Show Context)
Citation Context ... evaluating our ideas for simple process calculi. The results of such an experiment for the π-calculus appear in [22]. In this paper we apply our method to the ambient calculus of Cardelli and Gordon =-=[6]-=-. The ambient calculus has enjoyed success as a foundational model of distributed processes. It essentially comprises hierarchically arranged processes which can migrate, as well as dynamically modify... |

361 | An object calculus for asynchronous communication
- Honda, Tokoro
- 1991
(Show Context)
Citation Context ...ct is observed in [17] and a suitable adaptation of the definition of bisimulation is given to account for this. For aesthetic reasons we prefer to use ordinary bisimulation and thus use Honda-Tokoro =-=[14]-=- style rules instead. Interestingly, such rules are needed for [in n] and [out n] transitions only (cf. Fig. 9) and account for the following situation: the context provides the appropriate χ (cf. Lem... |

303 |
Higher-order abstract syntax
- Pfenning, Elliott
- 1988
(Show Context)
Citation Context ...-syntax We shall use a meta-syntax for simple syntactic manipulation of terms. The meta-syntax is a simply typed λ-calculus and can be thought of as a primitive system of higher order abstract syntax =-=[24]-=-. In (3) below we extend 8the base types (1) with function types that will be necessary in order to type terms in the metasyntax. σ ::= . . . | σ → σ (3) The λ-calculus operators added to the signatu... |

220 |
J.W.: Algebra of communicating processes with abstraction
- Bergstra, Klop
- 1985
(Show Context)
Citation Context ...ts systematically it compares very favourably with existing transition systems for the same calculus. Introduction Since the introduction of the archetypal process calculi, CCS [19], CSP [13] and ACP =-=[2]-=-, and the π-calculus [19] some years ago there has been a proliferation of calculus extensions and variants which address assorted computational features. One concern that is often voiced regarding th... |

156 | Types for mobile ambients, in
- Cardelli, Gordon
- 1999
(Show Context)
Citation Context ...lated and future work. The introduction of the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. [3, 9, 10]), type systems (e.g. =-=[4,7,18]-=-) and implementation details (e.g. [12,20]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was abandoned in favour of a simp... |

117 | R.: Deriving Bisimulation Congruences for Reactive Systems
- Leifer, Milner
(Show Context)
Citation Context ...given without further design. This approach is appealing but Sewell’s early results [23] were limited in their scope. This led Leifer and Milner to generalise the approach with some degree of success =-=[16]-=-. A general definition of contexts-as-labels was provided using the universal property of (relative) pushouts to obtain a suitable notion of minimality. Even so, this work still has its problems, the ... |

83 |
A Calculus for Communicating Systems, volume 92 of LNCS
- Milner
- 1980
(Show Context)
Citation Context ...ived our lts for ambients systematically it compares very favourably with existing transition systems for the same calculus. Introduction Since the introduction of the archetypal process calculi, CCS =-=[19]-=-, CSP [13] and ACP [2], and the π-calculus [19] some years ago there has been a proliferation of calculus extensions and variants which address assorted computational features. One concern that is oft... |

71 | From rewrite rules to bisimulation congruences
- Sewell
- 1998
(Show Context)
Citation Context ...ntics, particularly their labelled transition semantics, are often ad hoc and heavily locally optimised. This state of affairs is unsatisfactory and initial attempts to address the issue were made in =-=[23]-=- where it was proposed that labelled transitions should be derived (rather than defined) by means of considering underlying reduction rules for the language and taking labels to be suitably minimal co... |

57 | Equational properties for mobile ambients
- Cardelli, Gordon
- 1999
(Show Context)
Citation Context ...tion details (e.g. [12,20]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was abandoned in favour of a simpler approach in =-=[8]-=-. Interestingly, the structural rules and use of abstractions in the meta-language was already present in [5] where the authors seemed to encounter difficulty lay in relating their structural labels t... |

56 | A calculus of communicating systems with label passing
- Engberg, Nielsen
- 1986
(Show Context)
Citation Context ...systems (lts), structural operational semantics (sos), ambient calculus, bisimulation Introduction Since the introduction of archetypal process calculi (CCS [21], CSP [15], ACP [2] and the π-calculus =-=[10, 22]-=-) there has been a proliferation of new languages, extensions and assorted variants of earlier calculi. Each addresses some computational feature and/or enjoys specific properties. One concern that is... |

55 | Bisimulation congruences in safe ambients, in
- Merro, Hennessy
- 2002
(Show Context)
Citation Context ...counterpart in [19] that represents the state of the art for this language to date. In addition to the work mentioned above there have been a number of lts models for variants of the ambient calculus =-=[13, 11, 12, 4]-=-. These models all use a variant of the language for which the contextual observations of coactions are much clearer than in the pure ambient model and therefore the co-action labelled transitions are... |

42 | V.: Communication interference in mobile boxed ambients
- Bugliesi, Crafa, et al.
- 2002
(Show Context)
Citation Context ...(C+HT )A Q. ⊓⊔ 4 Conclusions, related and future work. The introduction of the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. =-=[3, 9, 10]-=-), type systems (e.g. [4,7,18]) and implementation details (e.g. [12,20]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was... |

32 | On bisimulations for the asynchronous pi-calculus
- Amadio, Castellani, et al.
- 1998
(Show Context)
Citation Context ...Unlike [17] we deal with the unobservability of [in n] and [out n] actions using Honda Tokoro style [14] rules in Fig. 9 rather than adopting a non-standard definition of bisimulation in the style of =-=[1]-=-. In conclusion, our derived lts is pleasingly similar to, and, we believe, conceptually cleaner than its counterpart in [17] which represents the state of the art for this language to date. In additi... |

29 | Typing and subtyping mobility in boxed ambients - Merro, Sassone - 2002 |

16 | P.: Semantic Barbs and Biorthogonality
- Rathke, Sassone, et al.
- 2007
(Show Context)
Citation Context ...ion barbed congruence. It is outside of the scope of this paper to give a systematic explanation of how the correct barbs are to be chosen in general. Some progress towards this goal has been made in =-=[27]-=-. Below we recall a suitable definition of barb for the ambient calculus and the definition of the equivalence itself. Definition 5 (Barbs). We say that a term P barbs on an ambient m, written P↓m, if... |

15 | Reactive systems, barbed semantics, and the mobile ambients
- Bonchi, Gadducci, et al.
- 2009
(Show Context)
Citation Context ...as “truly” structural. Our justification was that the use of structural congruence was not ineradicable. In this paper we put this into practice. This fact should be contrasted with other recent work =-=[3]-=-, in which the use of structural congruence is unavoidable. Structure of the paper. We present the syntax and semantics of the ambient calculus, along with a suitable contextually defined equivalence,... |

12 | Behavioural theory for mobile ambients
- Merro, Nardelli
- 2005
(Show Context)
Citation Context ...se but simply as a small calculus with an interesting set of reduction rules for which it has thus far proven difficult to provide a definitive labelled transition system and bisimulation equivalence =-=[5, 17]-=-. Our purpose is not necessarily to improve or undermine the existing labelled transition systems but to systematically derive one. The approach we take is to consider the underlying ground rewrite ru... |

11 | Deconstructing behavioural theories of mobility
- Rathke, Sobocinski
- 2008
(Show Context)
Citation Context ...pond to a contextually defined equivalence. This task is difficult and we have begun by evaluating our ideas for simple process calculi. The results of such an experiment for the π-calculus appear in =-=[22]-=-. In this paper we apply our method to the ambient calculus of Cardelli and Gordon [6]. The ambient calculus has enjoyed success as a foundational model of distributed processes. It essentially compri... |

7 | An efficient abstract machine for safe ambients
- Hirschkoff, Pous, et al.
(Show Context)
Citation Context ...the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. [3, 9, 10]), type systems (e.g. [4,7,18]) and implementation details (e.g. =-=[12,20]-=-). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was abandoned in favour of a simpler approach in [8]. Interestingly, the st... |

5 | Boxed ambients with communication interfaces
- Garralda, Bonelli, et al.
- 2007
(Show Context)
Citation Context ...(C+HT )A Q. ⊓⊔ 4 Conclusions, related and future work. The introduction of the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. =-=[3, 9, 10]-=-), type systems (e.g. [4,7,18]) and implementation details (e.g. [12,20]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was... |

5 |
A commitment relation for the ambient calculus, unpublished notes
- Cardelli, Gordon
- 1996
(Show Context)
Citation Context ... interesting set of reduction rules. Moreover, endowing it with a labelled transition system and bisimulation equivalence was historically viewed as a challenging and worthwhile goal in its own right =-=[6, 19]-=-. It is, therefore, an ideal place to develop, apply and hone generally applicable syntactic techniques for the derivation of structural labelled transition systems. Indeed, the ambient calculus contr... |

3 |
A commitment relation for the ambient calculus
- Cardelli, Gordon
- 1996
(Show Context)
Citation Context ...se but simply as a small calculus with an interesting set of reduction rules for which it has thus far proven difficult to provide a definitive labelled transition system and bisimulation equivalence =-=[5, 17]-=-. Our purpose is not necessarily to improve or undermine the existing labelled transition systems but to systematically derive one. The approach we take is to consider the underlying ground rewrite ru... |

3 |
On bisimulations for the asynchronous pi-calculus, Theor
- Amadio, Castellani, et al.
- 1998
(Show Context)
Citation Context ...Unlike [19] we deal with the unobservability of [in n] and [out n] actions using Honda Tokoro style [16] rules in Fig. 5 rather than adopting a non-standard definition of bisimulation in the style of =-=[1]-=-. In conclusion, our derived lts is pleasingly similar to, and, we believe, conceptually cleaner than its counterpart in [19] that represents the state of the art for this language to date. In additio... |

2 |
Fair ambients
- Fu
(Show Context)
Citation Context ...(C+HT )A Q. ⊓⊔ 4 Conclusions, related and future work. The introduction of the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. =-=[3, 9, 10]-=-), type systems (e.g. [4,7,18]) and implementation details (e.g. [12,20]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was... |

2 | Specifying and implementing secure mobile applications in the channel ambient system
- Phillips
- 2006
(Show Context)
Citation Context ...the ambient calculus in [6] has spawned an enormous amount of research on the topic regarding variants of the calculus (e.g. [3, 9, 10]), type systems (e.g. [4,7,18]) and implementation details (e.g. =-=[12,20]-=-). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [5] was abandoned in favour of a simpler approach in [8]. Interestingly, the st... |

2 | P.: Making the unobservable, unobservable
- Rathke, Sobocinski
- 2009
(Show Context)
Citation Context ...or the ambient calculus in Section 2. Section 3 lists the properties of the lts: bisimulation equivalence is proved to be sound for reduction barbed congruence and, after the addition of Honda-Tokoro =-=[15, 25]-=- style rules to account for unobservability of certain actions, complete. We include a comparison with related work in Section 4 and close with some concluding remarks regarding future work. Due to sp... |

1 |
Equational properties of mobile ambients
- Sc
- 2003
(Show Context)
Citation Context ...gun by evaluating our ideas for well-known process calculi. The results of such an experiment for the π-calculus appear in [28]. The present paper concerns the ambient calculus of Cardelli and Gordon =-=[8]-=- and is an extended version of a conference paper [29]. Another recent work in this area is [30]. The ambient calculus has enjoyed some success as a foundational model of spatially distributed, concur... |

1 |
Boxed Ambients with
- Garralda, Bonelli, et al.
- 2007
(Show Context)
Citation Context ...′ ≃ Q ′′ . 6. Conclusions, related and future work. The introduction of the ambient calculus in [8] has spawned a considerable amount of research on the topic regarding variants of the calculus (e.g. =-=[12, 11, 4]-=-), type systems (e.g. [20, 7, 5]) and implementation details (e.g. [14, 25]). However, there has been relatively little work on labelled characterisations. An early attempt by Cardelli and Gordon [6] ... |

1 |
Making the unobservable, unobservable, Electron
- Rathke, Sobociński
(Show Context)
Citation Context ...or the π-calculus appear in [28]. The present paper concerns the ambient calculus of Cardelli and Gordon [8] and is an extended version of a conference paper [29]. Another recent work in this area is =-=[30]-=-. The ambient calculus has enjoyed some success as a foundational model of spatially distributed, concurrent processes that are hierarchically arranged, can migrate and dynamically modify the structur... |