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.
Originalsprog | Engelsk |
---|---|
Udgivelsessted | Copenhagen |
Udgiver | IT-Universitetet i København |
Udgave | TR 2010-135 |
Antal sider | 30 |
ISBN (Elektronisk) | 978-87-7949-228-8 |
Status | Udgivet - 2010 |
Navn | IT University Technical Report Series |
---|---|
Nummer | TR-2010-135 |
ISSN | 1600-6100 |
Emneord
- Bigraphical Reactive Systems
- Matching Algorithm
- BPL Tool
- Polyadic π Calculus
- Mobile Phone System Simulation