We are studying a particular graph abstraction, based on the concept of retaining neighbourhood information up to a certain radius for each node. In this contribution, we present a modal logic on graphs that is preserved and reflected by this abstraction. This is one of the main results from the EATCS Best Theoretical Paper at the International Conference on Graph Transformation 2008.
|Number of pages||11|
|Journal||Bulletin of the European Association for Theoretical Computer Science|
|Publication status||Published - Feb 2009|