Modeling concurrency by node replacement systems
I would like to present a number of ideas for building a theory of true concurrency for graph rewriting systems based on node replacement, where the composition of processes replaces the...

I will give a brief introduction in: Verification of Well-Structured Graph Transformation Systems
As already mentioned we use the theory of well-structured transition systems to solve the coverability problem for graph transformation systems. The...

My main remark is that we should perhaps be somewhat more ambitious, and more general, in choosing the topics and question. I would not like to be bogged down in technical details and miss a chance to discuss our goals, and the contributions we...

I am currently working on using the theory of well-structured transition systems for verification. Since our graph transformation systems have to be well-structured (with respect to some order), we are somewhat limited, but we hope to relax this...

The workshop will take place in the David Wilson Library, First Floor Library Seminar Room (DW LIB SR), starting Thursday 24/01, 2pm and finishing Saturday 26/01, 12pm.
For maps and travel information, see here. See the map of the...

Concurrency of Graph Transformations with NACs and Open Maps
We study general reflection constraints on matches (formalised categorically via open maps) that are inspired by the definition of matching in kappa. Such constraints, which can be...

To refine the questions above, I can see several ways to develop such a theme. One could target (1) a specific hardware platform, (2) a programming langauge known to compile to one or more platforms of interest, or (3) develop a conceptual model of...