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