An Implementation of Bigraph Matching

Arne John Glenstrup; Troels Christoffer Damgaard; Lars Birkedal; Espen Højsgaard

An Implementation of Bigraph Matching

Arne John Glenstrup, Troels Christoffer Damgaard, Lars Birkedal, Espen Højsgaard

Research output: Working paper › Research

Abstract

We describe a provably sound and complete matching
algorithm for bigraphical reactive systems. The algorithm has been
implemented in our BPL Tool, a first implementation of bigraphical
reactive systems. We describe the tool and present a concrete
example of how it can be used to simulate a model of a mobile phone
system in a bigraphical representation of the polyadic π calculus.

Original language	English
Place of Publication	Copenhagen
Publisher	IT-Universitetet i København
Edition	TR 2010-135
Number of pages	30
ISBN (Electronic)	978-87-7949-228-8
Publication status	Published - 2010

Series	IT University Technical Report Series
Number	TR-2010-135
ISSN	1600-6100

Keywords

Bigraphical Reactive Systems
Matching Algorithm
BPL Tool
Polyadic π Calculus
Mobile Phone System Simulation

Access to Document

An Implementation of Bigraph MatchingSubmitted manuscript, 379 KB

Cite this

@techreport{f1dcf02964f4418fb0ff99d0d39a9821,

title = "An Implementation of Bigraph Matching",

abstract = " We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model of a mobile phone system in a bigraphical representation of the polyadic π calculus.",

keywords = "Bigraphical Reactive Systems, Matching Algorithm, BPL Tool, Polyadic π Calculus, Mobile Phone System Simulation, Bigraphical Reactive Systems, Matching Algorithm, BPL Tool, Polyadic π Calculus, Mobile Phone System Simulation",

author = "Glenstrup, {Arne John} and Damgaard, {Troels Christoffer} and Lars Birkedal and Espen H{\o}jsgaard",

year = "2010",

language = "English",

series = "IT University Technical Report Series",

number = "TR-2010-135",

publisher = "IT-Universitetet i K{\o}benhavn",

address = "Denmark",

edition = "TR 2010-135",

type = "WorkingPaper",

institution = "IT-Universitetet i K{\o}benhavn",

}

TY - UNPB

T1 - An Implementation of Bigraph Matching

AU - Glenstrup, Arne John

AU - Damgaard, Troels Christoffer

AU - Birkedal, Lars

AU - Højsgaard, Espen

PY - 2010

Y1 - 2010

N2 - We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model of a mobile phone system in a bigraphical representation of the polyadic π calculus.

AB - We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model of a mobile phone system in a bigraphical representation of the polyadic π calculus.

KW - Bigraphical Reactive Systems

KW - Matching Algorithm

KW - BPL Tool

KW - Polyadic π Calculus

KW - Mobile Phone System Simulation

KW - Bigraphical Reactive Systems

KW - Matching Algorithm

KW - BPL Tool

KW - Polyadic π Calculus

KW - Mobile Phone System Simulation

M3 - Working paper

T3 - IT University Technical Report Series

BT - An Implementation of Bigraph Matching

PB - IT-Universitetet i København

CY - Copenhagen

ER -