Finitary M-adhesive categories

Simple item page
dc.contributor.authorGabriel, Karsten
dc.contributor.authorBraatz, Benjamin
dc.contributor.authorEhrig, Hartmut
dc.contributor.authorGolas, Ulrike
dc.date.accessioned2017-11-23T12:53:23Z
dc.date.available2017-11-23T12:53:23Z
dc.date.issued2014
dc.descriptionDieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.de
dc.descriptionThis publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.en
dc.description.abstractFinitary M-adhesive categories are M-adhesive categories with finite objects only, where M-adhesive categories are a slight generalisation of weak adhesive high-level replacement (HLR) categories. We say an object is finite if it has a finite number of M-subobjects. In this paper, we show that in finitary M-adhesive categories we not only have all the well-known HLR properties of weak adhesive HLR categories, which are already valid for M-adhesive categories, but also all the additional HLR requirements needed to prove classical results including the Local Church-Rosser, Parallelism, Concurrency, Embedding, Extension and Local Confluence Theorems, where the last of these is based on critical pairs. More precisely, we are able to show that finitary M-adhesive categories have a unique ε'-M factorisation and initial pushouts, and the existence of an M-initial object implies we also have finite coproducts and a unique ε' -M pair factorisation. Moreover, we can show that the finitary restriction of each M-adhesive category is a finitary M-adhesive category, and finitarity is preserved under functor and comma category constructions based on M-adhesive categories. This means that all the classical results are also valid for corresponding finitary M-adhesive transformation systems including several kinds of finitary graph and Petri net transformation systems. Finally, we discuss how some of the results can be extended to non-M-adhesive categories.en
dc.identifier.eissn1469-8072
dc.identifier.issn0960-1295
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/7163
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-6438
dc.language.isoen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Datenverarbeitung; Informatik
dc.titleFinitary M-adhesive categoriesen
dc.typeArticle
dc.type.versionpublishedVersion
dcterms.bibliographicCitation.articlenumbere240403
dcterms.bibliographicCitation.doi10.1017/s0960129512000321
dcterms.bibliographicCitation.issue4
dcterms.bibliographicCitation.journaltitleMathematical structures in computer science
dcterms.bibliographicCitation.originalpublishernameCambridge University Press
dcterms.bibliographicCitation.originalpublisherplaceCambridge
dcterms.bibliographicCitation.volume24
tub.accessrights.dnbdomain
tub.affiliationFak. 4 Elektrotechnik und Informatik::Inst. Softwaretechnik und Theoretische Informatikde
tub.affiliation.facultyFak. 4 Elektrotechnik und Informatikde
tub.affiliation.instituteInst. Softwaretechnik und Theoretische Informatikde
tub.publisher.universityorinstitutionTechnische Universität Berlin

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
finitary_mathcalmadhesive_categories.pdf
Size:
1.32 MB
Format:
Adobe Portable Document Format
Download

Collections

Publications