Journal ArticleOPEN ACCESS

An inductive characterization of matching in binding bigraphs

Formal Aspects of Computing (2013) 25(2) 257-288
DOI: 10.1007/s00165-011-0184-5
7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems. © 2011 British Computer Society.

Author supplied keywords

Cite

CITATION STYLE

APA

Damgaard, T. C., Glenstrup, A. J., Birkedal, L., & Milner, R. (2013). An inductive characterization of matching in binding bigraphs. Formal Aspects of Computing, 25(2), 257–288. https://doi.org/10.1007/s00165-011-0184-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free