Graph abstraction and abstract graph transformations (Amended version)

I.B. Boneva, Jörg Kreiker, M.E. Kurban, Arend Rensink, Eduardo Zambon

    Research output: Book/ReportReportProfessional

    44 Downloads (Pure)


    Many important systems such as concurrent heap-manipulating programs, communication networks, or distributed algorithms, are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation for the states of these systems, where transitions can be conveniently described by graph transformation rules. We present a framework for the abstraction of graphs supporting abstract graph transformation. The abstraction method naturally generalises previous approaches to abstract graph transformation. The set of possible abstract graphs is finite. This has the pleasant consequence of generating a finite transition system for any start graph and any finite set of transformation rules. Moreover, abstraction preserves a simple logic for expressing properties on graph nodes. The precision of the abstraction can be adjusted according to the properties expressed in this logic that are to be verified.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages54
    Publication statusPublished - Oct 2012

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    ISSN (Print)1381-3625


    • IR-84368
    • System Verification
    • Graph Abstraction
    • GROOVE
    • METIS-289767
    • EWI-22466
    • Graph Transformation

    Cite this