Bigraphs by Example
TR-2005-61, Authors: Søren Debois and Troels Christoffer Damgaard
Bigraphs by Example
October 2005
Abstract
To gain familiarity with bigraphs and to investigate their modeling capabilities, we model a switch, finite automata, the game of "life'', combinatory logic, term unification and an event-driven system as bigraphical reactive systems.
Technical report TR-2005-61 in IT University Technical Report Series, October 2005.
Available as PDF.