Results 1 -
4 of
4
Bigraphical Models of Context-aware Systems
, 2005
"... As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of context-aware systems, a facet of ubiquitous computing. We find that naively encoding such systems in bigraphs is somewhat awkward; and we propose a more sophisticated modeling technique ..."
Abstract
-
Cited by 20 (14 self)
- Add to MetaCart
As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of context-aware systems, a facet of ubiquitous computing. We find that naively encoding such systems in bigraphs is somewhat awkward; and we propose a more sophisticated modeling technique, introducing Plato-graphical models, alleviating this awkwardness. We argue that such models are useful for simulation and point out that for reasoning about such bigraphical models, the bisimilarity inherent to bigraphical reactive systems is not enough in itself; an equivalence between the bigraphical reactive systems themselves is also needed.
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
- Proceedings of the Graph Transformation for Verification and Concurrency workshop (GT-VC'05)
, 2006
"... Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the π-calculus and the Mobile Ambients calculus. We give the first bigraphical presentatio ..."
Abstract
-
Cited by 16 (10 self)
- Add to MetaCart
Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the π-calculus and the Mobile Ambients calculus. We give the first bigraphical presentation of a non-linear, higher-order process calculus with nested locations, non-linear active process mobility, and local names, the calculus of Higher-Order Mobile Embedded Resources (Homer). The presentation is based on Milner’s recent presentation of the λ-calculus in local bigraphs. The combination of non-linear active process mobility and local names requires a new definition of parametric reaction rules and a representation of the location of names. We suggest localised bigraphs as a generalisation of local bigraphs in which links can be further localised. Key words: bigraphs, local names, non-linear process mobility
Axiomatizing Binding Bigraphs
- NORDIC JOURNAL OF COMPUTING
, 2006
"... We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms. Our work builds on Milner’s axioms for pure bigraphs. We have extended the ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms. Our work builds on Milner’s axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner’s axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner’s for pure bigraphs.

