Executing bigraphical reactive systems - LAAS-Réseaux et Communications Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2019

Executing bigraphical reactive systems

Résumé

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.
Fichier principal
Vignette du fichier
Gassara2018_HAL.pdf (543.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01879533 , version 1 (24-09-2018)

Identifiants

Citer

Amal Gassara, Ismael Bouassida Rodriguez, Mohamed Jmaiel, Khalil Drira. Executing bigraphical reactive systems. Discrete Applied Mathematics, 2019, 253, pp.73-92. ⟨10.1016/j.dam.2018.07.006⟩. ⟨hal-01879533⟩
84 Consultations
243 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More