## Abstract

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner's local bigraphs as a sorting on pure bigraphs.

Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as

a sorting.

Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as

a sorting.

Original language | English |
---|---|

Book series | Lecture Notes in Computer Science |

Volume | 5201 |

Pages (from-to) | 218-232 |

Number of pages | 15 |

ISSN | 0302-9743 |

DOIs | |

Publication status | Published - 2008 |

Event | International Conference on Concurrency Theory 2008 - Toronto, Canada Duration: 19 Aug 2008 → 22 Aug 2008 Conference number: 19 |

### Conference

Conference | International Conference on Concurrency Theory 2008 |
---|---|

Number | 19 |

Country/Territory | Canada |

City | Toronto |

Period | 19/08/2008 → 22/08/2008 |