Results 1  10
of
27
Bigraphical Models of Contextaware Systems
, 2005
"... As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of contextaware 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 36 (15 self)
 Add to MetaCart
(Show Context)
As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of contextaware 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 Platographical 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.
Matching of Bigraphs
 PREPRINT OF GTVC 2006
, 2006
"... We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems. ..."
Abstract

Cited by 24 (12 self)
 Add to MetaCart
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.
On the Construction of Sorted Reactive Systems
 IN PROCEEDINGS OF CONCUR’08, LNCS
, 2008
"... We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
(Show Context)
We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner’s local bigraphs as a sorting on pure bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as a sorting.
Static bilog: a unifying language for spatial structures
 Fundamenta Informaticae
, 2007
"... Abstract. Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework we consider bigraphs, which are emerging as a an interesting (meta)model for spatial struct ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework we consider bigraphs, which are emerging as a an interesting (meta)model for spatial structures and distributed calculi. Since bigraphs are built orthogonally on two structures, a hierarchical place graph for locations and a link (hyper)graph for connections, we obtain a logic that is a natural composition of other two instances of BiLog: a Place Graph Logic and a Link Graph Logic. We prove that these instances generalise the spatial logics for trees, for graphs and for tree contexts. We also explore the concepts of separation and sharing in these logics. We note that both the operator * of Separation Logic and the operator  of spatial logics do not completely separate the underlying structures. These two different forms of separation can be naturally derived as instances of BiLog by using the complete separation induced by the tensor product of monoidal categories along with some form of sharing.
Local Reasoning about Data Update
 GDP FESTSCHRIFT ENTCS, TO APPEAR
"... We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to local Hoare reasoning using Separation Logic, and term rewriting. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to local Hoare reasoning using Separation Logic, and term rewriting.
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 6 (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.
Bigraphical models for protein and membrane interactions
 Proc. MeCBIC’09, EPTCS
, 2009
"... We present a bigraphical framework suited for modeling biological systems both at protein level and at membrane level. We characterize formally bigraphs corresponding to biologically meaningful systems, and bigraphic rewriting rules representing biologically admissible interactions. At the protein l ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
We present a bigraphical framework suited for modeling biological systems both at protein level and at membrane level. We characterize formally bigraphs corresponding to biologically meaningful systems, and bigraphic rewriting rules representing biologically admissible interactions. At the protein level, these bigraphic reactive systems correspond exactly to systems of κcalculus. Membranelevel interactions are represented by just two general rules, whose application can be triggered by proteinlevel interactions in a welldefined and precise way. This framework can be used to compare and merge models at different abstraction levels; in particular, higherlevel (e.g. mobility) activities can be given a formal biological justification in terms of lowlevel (i.e., protein) interactions. As examples, we formalize in our framework the vesiculation and the phagocytosis processes. 1
Local Reasoning about Tree Update
 MFPS 2006
, 2006
"... Separation Logic and Context Logic have been used to reason locally about heap update and simple tree update. We study local reasoning based on Context Logic for a more realistic, local treeupdate language which combines update commands with queries. This combination results in updates at multiple ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Separation Logic and Context Logic have been used to reason locally about heap update and simple tree update. We study local reasoning based on Context Logic for a more realistic, local treeupdate language which combines update commands with queries. This combination results in updates at multiple locations, which significantly affects the complexity of the reasoning.