Higher-order port-graph rewriting

Higher-order port-graph rewriting

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 por...

Full description

Bibliographic Details
Main Authors: Maribel Fernández, Sébastien Maulat
Format: Article
Language:English
Published: Open Publishing Association 2012-11-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1211.4098v1
id doaj-f05debb881584c7491b9c68170dddd3b
record_format Article
spelling doaj-f05debb881584c7491b9c68170dddd3b2020-11-24T21:31:59ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-11-01101Proc. LINEARITY 2012253710.4204/EPTCS.101.3Higher-order port-graph rewritingMaribel FernándezSébastien MaulatThe 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.http://arxiv.org/pdf/1211.4098v1
collection DOAJ
language English
format Article
sources DOAJ
author Maribel Fernández
Sébastien Maulat
spellingShingle Maribel Fernández
Sébastien Maulat
Higher-order port-graph rewriting
Electronic Proceedings in Theoretical Computer Science
author_facet Maribel Fernández
Sébastien Maulat
author_sort Maribel Fernández
title Higher-order port-graph rewriting
title_short Higher-order port-graph rewriting
title_full Higher-order port-graph rewriting
title_fullStr Higher-order port-graph rewriting
title_full_unstemmed Higher-order port-graph rewriting
title_sort higher-order port-graph rewriting
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-11-01
description 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.
url http://arxiv.org/pdf/1211.4098v1
work_keys_str_mv AT maribelfernandez higherorderportgraphrewriting
AT sebastienmaulat higherorderportgraphrewriting
_version_ 1725959084701646848

Similar Items