.png){kind=icon}
.png){kind=icon}
Return
Improving Bigraph Rewriting with GrGen.NET to Enable Efficient System Simulation
.png){kind=icon}
PRE
AI
DOI：10.1145/3736704.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bigraphs provide a versatile modeling framework by combining spatial and connectivity relationships, making them valuable in graph transformations, model transformations, the design of programming languages, and the simulation of reactive systems. However, practical approaches to bigraph rewriting often rely on constraint satisfaction or SAT-solving techniques, which can be computationally intensive and limit usability in large-scale applications. This article addresses the challenge of efficient bigraph rewriting by leveraging the graph transformation engine GRGEN.NET. We propose a novel approach to translate bigraphical rules into SPO-based graph transformation rules, enabling fast bigraph rewriting. Our solution is implemented in the tool BIGGER, which includes a command-line interface and a Java library for seamless integration. Through experimental evaluation, we demonstrate the correctness of our approach and its ability to significantly improve execution efficiency. Additionally, we implemented tracking rules that maintain semantic fidelity during the translation process and enable identity tracing across reactions, adding a feature to bigraphs that extends their applicability beyond static analysis.
Keywords:
Bigraphs
bigraphical reactive systems
graph rewriting
GrGen.NET
SPO
Journal
F
IF:
1.4
Papers:
23
Citations:
471