Resource-Bound Quantification for Graph Transformation
Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how i...
Main Authors: | Paolo Torrini, Reiko Heckel |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-03-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1003.5512v1 |
Similar Items
-
Bounds for the Energy of Graphs
by: Slobodan Filipovski, et al.
Published: (2021-07-01) -
Colourings of random graphs
by: Heckel, A
Published: (2016) -
Bounds on Nirmala energy of graphs
by: Yalçin N. Feyza
Published: (2022-12-01) -
On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01) -
Bounds for various graph energies
by: Sevgi Emre, et al.
Published: (2022-01-01)