| Reference : Subobject Transformation Systems |
| Scientific journals : Article | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/5597 | |||
| Subobject Transformation Systems | |
| English | |
| Corradini, Andrea [> >] | |
Hermann, Frank  [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Sobocinski, Pawel [] | |
| 2008 | |
| Applied Categorical Structures | |
| Springer | |
| 16 | |
| 3 | |
| 389--419 | |
| Yes | |
| International | |
| [en] 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. | |
| http://hdl.handle.net/10993/5597 | |
| 10.1007/s10485-008-9127-6 | |
| http://www.springerlink.com/content/1648jx522426p053/ |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
