ECEASST
2010
12 years 11 months ago
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 includ...
GG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
GG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
GG
2004
Springer
13 years 10 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
KCAP
2005
ACM
13 years 10 months ago
2005
ACM
The Designers’ Workbench is a system, developed by the Advanced Knowledge Technologies (AKT) consortium to support designers in large organizations, such as RollsRoyce, by makin...