Graph Abstraction for a Modal Logic

Iovka Boneva, H Ehrig (Editor), Jörg Kreiker, M.E. Kurban, Arend Rensink

    Research output: Contribution to journalArticleAcademic


    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.
    Original languageUndefined
    Pages (from-to)106-116
    Number of pages11
    JournalBulletin of the European Association for Theoretical Computer Science
    Publication statusPublished - Feb 2009


    • EWI-19548
    • IR-75905
    • METIS-275916

    Cite this