Aarhus University Seal / Aarhus Universitets segl

On the Construction of Sorted Reactive Systems

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

Documents

DOI

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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume5201
Pages (from-to)218-232
Number of pages15
ISSN0302-9743
DOIs
Publication statusPublished - 2008
Externally publishedYes

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 73743474