Graph Grammar Verification through Abstraction

Paolo Baldan, Barbara Koenig, Arend Rensink

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    10 Downloads (Pure)

    Abstract

    Until now there have been few contributions concerning the verification of graph grammars, specifically of infinite-state graph grammars. This paper compares two existing approaches, based on abstractions of graph transformation systems. While in the unfolding approach graph grammars are approximated by Petri nets, in the partitioning approach graphs are abstracted according to their local structure. We describe differences and similarities of the two approaches and explain the underlying ideas.
    Original languageEnglish
    Title of host publicationGraph Transformations and Process Algebras for Modeling Distributed and Mobile Systems
    EditorsBarbara König, Ugo Montanari, Philippa Gardner
    PublisherDagstuhl
    Number of pages9
    Publication statusPublished - 2005
    EventDagstuhl Seminar on Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 - Schloss Dagstuhl , Wadern, Germany
    Duration: 6 Jun 200511 Jun 2005

    Publication series

    NameDagstuhl Seminar Proceedings
    PublisherDagstuhl
    Volume04241
    ISSN (Print)1862-4405

    Conference

    ConferenceDagstuhl Seminar on Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004
    CountryGermany
    CityWadern
    Period6/06/0511/06/05

    Keywords

    • Graph Transformation
    • Verification

    Fingerprint Dive into the research topics of 'Graph Grammar Verification through Abstraction'. Together they form a unique fingerprint.

    Cite this