Algebraic graph rewriting using a single pushout

P.M. van den Broek

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)
    48 Downloads (Pure)

    Abstract

    We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.
    Original languageEnglish
    Title of host publicationTAPSOFT '91
    Subtitle of host publicationProceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991
    EditorsS. Abramski, T.S.E. Maibaum
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer
    Pages90-102
    Number of pages13
    ISBN (Electronic)978-3-540-46563-8
    ISBN (Print)978-3-540-53982-7
    DOIs
    Publication statusPublished - Apr 1991
    Event4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991 - Brighton, United Kingdom
    Duration: 8 Apr 199112 Apr 1991
    Conference number: 4

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer-Verlag
    Volume493
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991
    Abbreviated titleTAPSOFT
    CountryUnited Kingdom
    CityBrighton
    Period8/04/9112/04/91

    Cite this