Bigraphs and transitions

Ole Høgh Jensen; Robin Milner

doi:10.1145/604131.604135

Bigraphs and transitions

Ole Høgh Jensen, Robin Milner

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.

Original language	English
Title of host publication	POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages
Publisher	ACM
Pages	38-49
Number of pages	12
ISBN (Print)	1-58113-628-5
DOIs	https://doi.org/10.1145/604131.604135
Publication status	Published - 2003

Access to Document

10.1145/604131.604135

http://dl.acm.org/citation.cfm?doid=640128.604135

Cite this

@inproceedings{580879e4d0724057b6488c7fbea50871,

title = "Bigraphs and transitions",

abstract = "A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.",

author = "Jensen, {Ole H{\o}gh} and Robin Milner",

year = "2003",

doi = "10.1145/604131.604135",

language = "English",

isbn = "1-58113-628-5",

pages = "38--49",

booktitle = "POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages",

publisher = "ACM",

}

TY - GEN

T1 - Bigraphs and transitions

AU - Jensen, Ole Høgh

AU - Milner, Robin

PY - 2003

Y1 - 2003

N2 - A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.

AB - A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.

U2 - 10.1145/604131.604135

DO - 10.1145/604131.604135

M3 - Conference contribution

SN - 1-58113-628-5

SP - 38

EP - 49

BT - POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages

PB - ACM

ER -

Bigraphs and transitions

Abstract

Access to Document

Fingerprint

Cite this