Encoding Bigraphical Reactive Systems into Graph Transformation Systems

Gassara, Amal; Rodriguez, Ismael Bouassida; Jmaïel, Mohamed; Drira, Khalil

doi:10.1016/j.endm.2016.10.051

Search citation statements

Order By: Relevance

Paper Sections

Select...

Our Proposed Approach For Executing Brss1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2019

Publication Types

Select...

Article1

Book1

Other1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose a solution for executing BRSs based on an investigation of how to simulate a BRS with a GTS [17]. In other words, we simulate the application of a reaction rule on a bigraph with the application of a graph rule on a graph.…”

Section: Our Proposed Approach For Executing Brssmentioning

confidence: 99%

Executing bigraphical reactive systems

Gassara

Rodriguez

Jmaïel

et al. 2019

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

In order to enable experimentations and simulations of bigraphs, we need an implementation of their dynamic. In this paper, we tackle the matching issue of this task. We present a solution based on an investigation on graph matching. We propose to simulate a bigraphical reactive system (i.e., bigraphs with a set of reaction rules that allow their rewriting) with a graph transformation system. First, we translate a bigraph to a ranked graph. This translation is ensured by defining a faithful functor that allows to move from the bigraph category to the ranked graph category. Then, we show that reaction rules can be simulated with graph rules. Hence, we provide a formal basis allowing to execute bigraph transformations by simulating their translation aiming to use well-established and efficient graph transformation tools.

show abstract

Section: Our Proposed Approach For Executing Brssmentioning

confidence: 99%