Bigraphical Refinement

Abstract

We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for guaranteeing the existence of a safety-preserving vertical refinement. We postulate the existence of a complimentary notion of horizontal refinement for bigraphical agents, and finally we discuss the connection of this work to the general refinement of Reeves and Streader

Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems

“…In both cases interactions are based on the public state (the interface in SCEL lingo). Another topic to be investigated is the extraction of a MAS from an (enriched) BRS; this construction resembles bigraphical refinements [14], suggesting the possibility to apply results from the field of (bigraphical) language engineering to the approach presented in this paper.…”

“…Beside their normative and expressive power, BRSs are appealing because they provide a range of interesting general results and tools, which can be readily instantiated with the specific model under scrutiny: simulation tools, systematic construction of compositional bisimulations [12], graphical editors [8], general model checkers [15], modular composition [14], stochastic extensions [10], etc.…”

Computing Embeddings of Directed Bigraphs

“…Constraint (15) requires guest handles to send their output to exactly one destination thus rendering the sub-network between handles a function assigning guest handles to host handles. This mapping is subject to some additional conditions when edges Constraints (25) and (26) prevent roots and sites from the host to be matched with nodes or sites and nodes or roots respectively. (27) disables matching between nodes decorated with different controls.…”

“…(29) propagates the matching along the parent map from children to parents. Constraints (30) and (31) ensure that the matching is a function when restricted to guest nodes and roots (the codomain restriction follows by (25) and (26)). (32) says that if a node from the host cannot be matched with a root or a node/site from the guest at the same time; moreover, if the host node is matched with a node then it cannot be matched to anything else.…”

“…BRSs have been successfully applied to the formalization of a wide spectrum of domain-specific models, including context-aware systems, web-service orchestration languages [4,5,20,28]. BRSs are appealing because they provide a range of general results and tools, which can be readily instantiated with the specific model under scrutiny: libraries for bigraph manipulation (e.g., DBtk [1] and jLibBig [23,24]), simulation tools [10,19,21], graphical editors [9], model checkers [27], modular composition [26], stochastic extensions [18], etc.…”