No 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.

International audienceVarious calculi have been proposed to model diff erent levels of abstraction of cell signaling and molecular interactions. In this paper we propose a framework inspired by some of these calculi that structures interactions and agents from the most basic elements of the cell (protein interaction sites) to higher order ones (compartments and molecular species)