BDNF-Based Matching of Bigraphs

Troels Christoffer Damgaard, Martin Elsman, Lars Birkedal, Arne John Glenstrup

    Research output: Book / Anthology / Report / Ph.D. thesisReportResearch

    Abstract

    AbstractWe analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.
    Original languageEnglish
    Place of PublicationCopenhagen
    EditionTR-2006-93
    Number of pages48
    ISBN (Electronic)87-7949-137-5
    Publication statusPublished - Oct 2006
    SeriesIT University Technical Report Series
    NumberTR-2006-93
    ISSN1600-6100

    Fingerprint

    Dive into the research topics of 'BDNF-Based Matching of Bigraphs'. Together they form a unique fingerprint.

    Cite this