Abstract
In this paper, we present a solution for executing bigraphical reactive systems based on an investigation on graph transformation systems. For this, we encode a bigraph into a ranked graph. This encoding is ensured, formally, by defining a faithful functor that allows to move from bigraph category to ranked graph category. Then, we show that reaction rules can be simulated with graph rules.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have