ITU

On the Construction of Sorted Reactive Systems

Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

Standard

On the Construction of Sorted Reactive Systems. / Birkedal, Lars; Debois, Søren; Hildebrandt, Thomas.

In: Lecture Notes in Computer Science, Vol. 5201, 2008, p. 218-232.

Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

Harvard

APA

Vancouver

Author

Bibtex

@inproceedings{26cc3890040111deb97e000ea68e967b,
title = "On the Construction of Sorted Reactive Systems",
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 asa sorting.",
author = "Lars Birkedal and S{\o}ren Debois and Thomas Hildebrandt",
note = "Serie: Lecture Notes in Computer Science, Springer, 5201/2008, 0302-9743 Volumne: 5201/2008; null ; Conference date: 19-08-2008 Through 22-08-2008",
year = "2008",
doi = "10.1007/978-3-540-85361-9",
language = "English",
volume = "5201",
pages = "218--232",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer",

}

RIS

TY - GEN

T1 - On the Construction of Sorted Reactive Systems

AU - Birkedal, Lars

AU - Debois, Søren

AU - Hildebrandt, Thomas

N1 - Conference code: 19

PY - 2008

Y1 - 2008

N2 - 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 asa sorting.

AB - 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 asa sorting.

U2 - 10.1007/978-3-540-85361-9

DO - 10.1007/978-3-540-85361-9

M3 - Conference article

VL - 5201

SP - 218

EP - 232

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

Y2 - 19 August 2008 through 22 August 2008

ER -

ID: 963858