Matching of Bigraphs

被引：15

作者：

Birkedal, Lars ^{[1
]}

Damgaard, Troels Christoffer ^{[1
]}

Glenstrup, Arne John ^{[1
]}

Milner, Robin ^{[2
]}

机构：

[1] IT Univ Copenhagen, Copenhagen, Denmark

[2] Univ Cambridge, Cambridge, England

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2007年 / 175卷 / 04期

关键词：

Bigraphs; bigraphical reactive systems; matching; complete inductive characterization;

D O I：

10.1016/j.entcs.2007.04.013

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.

引用

页码：3 / 19

页数：17

共 20 条

[1]

Birkedal L, 2006, LECT NOTES COMPUT SC, V3921, P187

[2]

Birkedal L., 2006, 84 IT U COP

[3]

Birkedal L., 2004, 2 UK UBINET WORKSH C

[4]

Damgaard T. C., 2006, THESIS

[5]

Damgaard T.C., 2006, NORD J COMPUT, V13, P58

[6]

Ehrig H., 2006, MONO THEOR COMP SCI, DOI 10.1007/3-540-31188-2

[7] Directed graph pattern matching and topological embedding [J].

Fu, JJH .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1997, 22 (02) :372-391

[8]

Jensen O.H., 2006, THESIS

[9]

Jensen O. H., 2004, UCAMCLTR580

[10]

Larrosa J., 2002, Mathematical Structures in Computer Science, V12, P403, DOI 10.1017/S0960129501003577

← 1 2 →