Subobject transformation systems
Subobject transformation systems
Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church-Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.
graph transformation systems, adhesive categories, occurrence grammars
389-419
Corradini, Andrea
6cc7a106-fbf7-459c-90ae-bc855c67c664
Hermann, Frank
5a6541b0-ff64-46ea-b411-a228d0c789e1
Sobocinski, Pawel
439334ab-2826-447b-9fe5-3928be3fd4fd
2008
Corradini, Andrea
6cc7a106-fbf7-459c-90ae-bc855c67c664
Hermann, Frank
5a6541b0-ff64-46ea-b411-a228d0c789e1
Sobocinski, Pawel
439334ab-2826-447b-9fe5-3928be3fd4fd
Corradini, Andrea, Hermann, Frank and Sobocinski, Pawel
(2008)
Subobject transformation systems.
Applied Categorical Structures, 16 (3), .
(doi:10.1007/s10485-008-9127-6).
Abstract
Subobject transformation systems (STS) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church-Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.
This record has no associated files available for download.
More information
e-pub ahead of print date: 20 February 2008
Published date: 2008
Additional Information:
Imported from ISI Web of Science
Keywords:
graph transformation systems, adhesive categories, occurrence grammars
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 268962
URI: http://eprints.soton.ac.uk/id/eprint/268962
ISSN: 0927-2852
PURE UUID: 69f809a8-4dc2-4f72-aa64-a9cecbd4a894
Catalogue record
Date deposited: 21 Apr 2010 07:46
Last modified: 14 Mar 2024 09:15
Export record
Altmetrics
Contributors
Author:
Andrea Corradini
Author:
Frank Hermann
Author:
Pawel Sobocinski
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics