Analysis of permutation equivalence in M-adhesive transformation systems with negative application conditions

Simple item page
dc.contributor.authorHermann, Frank
dc.contributor.authorCorradini, Andrea
dc.contributor.authorEhrig, Hartmut
dc.date.accessioned2017-11-23T12:53:33Z
dc.date.available2017-11-23T12:53:33Z
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.abstractM-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs such as attribution as in the case of typed attributed graphs. In the current paper, we investigate M-adhesive transformation systems including negative application conditions (NACs) for transformation rules, which are often used in applications. For such systems, we propose an original equivalence on transformation sequences, called permutation equivalence, that is coarser than the classical switch equivalence. We also present a general construction of deterministic processes for M-adhesive transformation systems based on subobject transformation systems. As a main result, we show that the process obtained from a transformation sequence identifies its equivalence class of permutation-equivalent transformation sequences. Moreover, we show how the analysis of this process can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies between rule applications of the transformation sequence, including the inhibiting effects of the NACs.en
dc.identifier.eissn1469-8072
dc.identifier.issn0960-1295
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/7167
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-6442
dc.language.isoen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Datenverarbeitung; Informatik
dc.titleAnalysis of permutation equivalence in M-adhesive transformation systems with negative application conditionsen
dc.typeArticle
dc.type.versionpublishedVersion
dcterms.bibliographicCitation.articlenumbere240409
dcterms.bibliographicCitation.doi10.1017/s0960129512000382
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:
analysis_of_permutation_equivalence_in.pdf
Size:
976.12 KB
Format:
Adobe Portable Document Format
Download

Collections

Publications