Subobject transformation systems
Corradini, Andrea, Hermann, Frank and Sobocinski, Pawel (2008) Subobject transformation systems. Applied Categorical Structures, 16, (3), 389-419. (doi:10.1007/s10485-008-9127-6).
Full text not available from this repository.
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.
|Additional Information:||Imported from ISI Web of Science|
|Keywords:||graph transformation systems, adhesive categories, occurrence grammars|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||21 Apr 2010 07:46|
|Last Modified:||27 Mar 2014 20:15|
|Further Information:||Google Scholar|
|ISI Citation Count:||2|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)