Higher-order port-graph rewriting
Maribel Fern\'andez (King's College London), S\'ebastien Maulat, (\'Ecole Normale Sup\'erieure de Lyon)
TL;DR
This paper introduces higher-order features to port-graph rewriting, enhancing the modeling and visualization of complex systems such as proof-net reductions within the PORGY tool.
Contribution
It extends port-graph syntax with higher-order capabilities and provides a matching algorithm, enabling advanced graph rewriting and visualization.
Findings
Enhanced expressive power demonstrated with proof-net examples
Implementation of higher-order port-graph rewriting in PORGY
Facilitates visual study of complex system dynamics
Abstract
The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we add higher-order features to the original port-graph syntax, along with a generalised notion of graph morphism. We provide a matching algorithm which enables to implement higher-order port-graph rewriting in PORGY, thus one can visually study the dynamics of the systems modelled. We illustrate the expressive power of higher-order port-graphs with examples taken from proof-net reduction systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.