Abstract
We present strategic port graph rewriting as a basis for the implementation of visual modelling tools. The goal is to facilitate the specification and programming tasks associated with the modelling of complex systems. A system is represented by an initial graph and a collection of graph rewrite rules, together with a user-defined strategy to control the application of rules. The traditional operators found in strategy languages for term rewriting have been adapted to deal with the more general setting of graph rewriting, and some new constructs have been included in the strategy language to deal with graph traversal and management of rewriting positions in the graph. We give a formal semantics for the language, and describe its implementation: the graph transformation and visualisation tool Porgy.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. Specifying Fairness Constraints and Model Checking with Non-intensional Strategies;Lecture Notes in Computer Science;2024
3. Linear-Time Graph Programs for Unbounded-Degree Graphs;Lecture Notes in Computer Science;2024
4. The Maude strategy language;Journal of Logical and Algebraic Methods in Programming;2023-08
5. Unification of drags and confluence of drag rewriting;Journal of Logical and Algebraic Methods in Programming;2023-02