Article (Scientific journals)
Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories
Schölzel, Hanna; Ehrig, Hartmut; Maximova, Maria et al.
2012In Electronic Proceedings in Theoretical Computer Science, 93, p. 83-104
Peer Reviewed verified by ORBi


Full Text
Publisher postprint (414.17 kB)

All documents in ORBilu are protected by a user license.

Send to


Abstract :
[en] Application conditions for rules and constraints for graphs are well-known in the theory of graph transformation and have been extended already to M-adhesive transformation systems. According to the literature we distinguish between two kinds of satisfaction for constraints, called general and initial satisfaction of constraints, where initial satisfaction is defined for constraints over an initial object of the base category. Unfortunately, the standard definition of general satisfaction is not compatible with negation in contrast to initial satisfaction. Based on the well-known restriction of objects along type morphisms, we study in this paper restriction and amalgamation of application conditions and constraints together with their solutions. In our main result, we show compatibility of initial satisfaction for positive constraints with restriction and amalgamation, while general satisfaction fails in general. Our main result is based on the compatibility of composition via pushouts with restriction, which is ensured by the horizontal van Kampen property in addition to the vertical one that is generally satisfied in M-adhesive categories
Disciplines :
Computer science
Identifiers :
Author, co-author :
Schölzel, Hanna;  TU Berlin, Germany
Ehrig, Hartmut;  TU Berlin, Germany
Maximova, Maria;  TU Berlin, Germany
Gabriel, Karsten;  TU Berlin, Germany
Hermann, Frank ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Language :
Title :
Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories
Publication date :
Journal title :
Electronic Proceedings in Theoretical Computer Science
Publisher :
Open Publishing Association
Volume :
Pages :
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 17 July 2013


Number of views
71 (5 by Unilu)
Number of downloads
103 (1 by Unilu)

Scopus citations®
Scopus citations®
without self-citations


Similar publications

Contact ORBilu