Reference:
Hartmut Ehrig, Annegret Habel and Leen Lambers, "Parallelism and Concurrency Theorems for Rules with Nested Application Conditions", in Festschrift dedicated to Hans-Jorg Kreowski at the Occasion of his 60th Birthday, vol. 26, EC-EASST, 2010.
Abstract:
We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories including different kinds of graphs. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over morphisms and rules.
Links:
@InCollection{EHL10,
AUTHOR = {Ehrig, Hartmut and Habel, Annegret and Lambers, Leen},
TITLE = {{Parallelism and Concurrency Theorems for Rules with Nested Application Conditions}},
YEAR = {2010},
BOOKTITLE = {Festschrift dedicated to Hans-Jorg Kreowski at the Occasion of his 60th Birthday},
VOLUME = {26},
PUBLISHER = {EC-EASST},
URL = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/viewFile/363/333},
OPTacc_url = {},
PDF = {uploads/pdf/EHL10.pdf},
OPTacc_pdf = {},
ABSTRACT = {We present Local Church-Rosser, Parallelism, and Concurrency Theorems
for rules with nested application conditions in the framework of weak adhesive
HLR categories including different kinds of graphs. The proofs of the statements are
based on the corresponding statements for rules without application conditions and
two Shift-Lemmas, saying that nested application conditions can be shifted over
morphisms and rules.}
}
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