Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

An inductive characterization of matching in binding bigraphs

Troels C. Damgaard,Arne J. Glenstrup,Lars Birkedal,Robin Milner

Formal Asp. Comput.（2011）

Cited 17|Views7
No score
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.
More
Translated text
Key words
Bigraphs, Bigraphical reactive systems, Matching, Complete inductive characterization
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined