An inductive characterization of matching in binding bigraphs

Formal Asp. Comput.(2011)

引用 17|浏览6
暂无评分
摘要
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.
更多
查看译文
关键词
Bigraphs, Bigraphical reactive systems, Matching, Complete inductive characterization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要