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: | , |
|---|---|
| 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 |
| _version_ | 1811251052835504128 |
|---|---|
| author | Paolo Torrini Reiko Heckel |
| author_facet | Paolo Torrini Reiko Heckel |
| author_sort | Paolo Torrini |
| collection | DOAJ |
| description | 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 intuitionistic linear logic can be extended with resource-bound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems. |
| first_indexed | 2024-04-12T16:13:44Z |
| format | Article |
| id | doaj.art-94aaca090f004d15bb013523fd071a5d |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-04-12T16:13:44Z |
| publishDate | 2010-03-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-94aaca090f004d15bb013523fd071a5d2022-12-22T03:25:47ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-03-0122Proc. LINEARITY 2009142510.4204/EPTCS.22.2Resource-Bound Quantification for Graph TransformationPaolo TorriniReiko HeckelGraph 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 intuitionistic linear logic can be extended with resource-bound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems.http://arxiv.org/pdf/1003.5512v1 |
| spellingShingle | Paolo Torrini Reiko Heckel Resource-Bound Quantification for Graph Transformation Electronic Proceedings in Theoretical Computer Science |
| title | Resource-Bound Quantification for Graph Transformation |
| title_full | Resource-Bound Quantification for Graph Transformation |
| title_fullStr | Resource-Bound Quantification for Graph Transformation |
| title_full_unstemmed | Resource-Bound Quantification for Graph Transformation |
| title_short | Resource-Bound Quantification for Graph Transformation |
| title_sort | resource bound quantification for graph transformation |
| url | http://arxiv.org/pdf/1003.5512v1 |
| work_keys_str_mv | AT paolotorrini resourceboundquantificationforgraphtransformation AT reikoheckel resourceboundquantificationforgraphtransformation |