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.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2011
- DOI:
- 10.48550/arXiv.1106.4091
- arXiv:
- arXiv:1106.4091
- Bibcode:
- 2011arXiv1106.4091P
- Keywords:
-
- Computer Science - Software Engineering
- E-Print:
- In Proceedings Refine 2011, arXiv:1106.3488