Aarhus University Seal / Aarhus Universitets segl

Axiomatizing binding bigraphs

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

Standard

Axiomatizing binding bigraphs. / Damgaard, Troels C.; Birkedal, Lars.

In: Nordic Journal of Computing, Vol. 33, No. 1, 2006, p. 58 - 77 .

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

Harvard

Damgaard, TC & Birkedal, L 2006, 'Axiomatizing binding bigraphs', Nordic Journal of Computing, vol. 33, no. 1, pp. 58 - 77 . <http://dl.acm.org/citation.cfm?id=1161598&CFID=557689612&CFTOKEN=63942596>

APA

CBE

Damgaard TC, Birkedal L. 2006. Axiomatizing binding bigraphs. Nordic Journal of Computing. 33(1):58 - 77 .

MLA

Damgaard, Troels C. and Lars Birkedal. "Axiomatizing binding bigraphs". Nordic Journal of Computing. 2006, 33(1). 58 - 77 .

Vancouver

Damgaard TC, Birkedal L. Axiomatizing binding bigraphs. Nordic Journal of Computing. 2006;33(1):58 - 77 .

Author

Damgaard, Troels C. ; Birkedal, Lars. / Axiomatizing binding bigraphs. In: Nordic Journal of Computing. 2006 ; Vol. 33, No. 1. pp. 58 - 77 .

Bibtex

@inproceedings{cfd1b3ba58c4405ab7160e4881ad7219,
title = "Axiomatizing binding bigraphs",
abstract = "We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner's axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner's for pure bigraphs.",
author = "Damgaard, {Troels C.} and Lars Birkedal",
note = "Title of the issue: Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005; null ; Conference date: 19-10-2005 Through 21-10-2005",
year = "2006",
language = "English",
volume = "33",
pages = "58 -- 77 ",
journal = "Nordic Journal of Computing",
issn = "1236-6064",
publisher = "University of Helsinki Department of Computer Science",
number = "1",

}

RIS

TY - GEN

T1 - Axiomatizing binding bigraphs

AU - Damgaard, Troels C.

AU - Birkedal, Lars

N1 - Conference code: 17

PY - 2006

Y1 - 2006

N2 - We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner's axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner's for pure bigraphs.

AB - We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner's axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner's for pure bigraphs.

M3 - Conference article

VL - 33

SP - 58

EP - 77

JO - Nordic Journal of Computing

JF - Nordic Journal of Computing

SN - 1236-6064

IS - 1

Y2 - 19 October 2005 through 21 October 2005

ER -