Higher-order port-graph rewriting

Maribel Fernández
(King's College London)
Sébastien Maulat
(École Normale Supérieure de Lyon)

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.

In Sandra Alves and Ian Mackie: Proceedings 2nd International Workshop on Linearity (LINEARITY 2012), Tallinn, Estonia, 1 April 2012, Electronic Proceedings in Theoretical Computer Science 101, pp. 25–37.
Published: 15th November 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.101.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org