Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences (bibtex)
Reference:
Leen Lambers, Hartmut Ehrig and Gabriele Taentzer, "Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences", Technical Report 2008-2, Technische Universitat Berlin, 2008.
Abstract:
In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence of rules is applicable (resp. not applicable) on a given graph? Of course, it is possible to use a trial and error strategy to find out the answer to these questions. In this paper however, we will formulate suitable sufficient criteria for applicability and other ones for non-applicability. These criteria can be checked in a static way i.e. without trying to apply the whole rule sequence explicitly. Moreover if a certain criterion is not satisfied, then this is an indication for reasons why rule sequences may or may not be applicable. Consequently it is easier to rephrase critical rule sequences. The results are formulated within the framework of double pushout (DPO) graph transformations with negative application conditions (NACs).
Links:
[bibtex] [url]
@TechReport{LET08-TR,
AUTHOR = {Lambers, Leen and Ehrig, Hartmut and Taentzer, Gabriele},
TITLE = {{Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences}},
YEAR = {2008},
NUMBER = {2008-2},
INSTITUTION = {Technische Universitat Berlin},
URL = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2008/2008-02.pdf},
PDF = {uploads/pdf/LET08-TR_2008-02.pdf},
OPTacc_pdf = {},
ABSTRACT = {In several rule-based applications using graph transformation as underlying modeling technique the following
questions arise: How can one be sure that a specific sequence of rules is applicable (resp. not applicable)
on a given graph? Of course, it is possible to use a trial and error strategy to find out the answer to these
questions. In this paper however, we will formulate suitable sufficient criteria for applicability and other ones
for non-applicability. These criteria can be checked in a static way i.e. without trying to apply the whole rule
sequence explicitly. Moreover if a certain criterion is not satisfied, then this is an indication for reasons why
rule sequences may or may not be applicable. Consequently it is easier to rephrase critical rule sequences.
The results are formulated within the framework of double pushout (DPO) graph transformations with
negative application conditions (NACs).}
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Powered by bibtexbrowser