Affiliation:
1. Aalborg University, Denmark
2. University of Cambridge, UK
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference23 articles.
1. The chemical abstract machine
2. Boudol G. (1992) Asynchrony and the λ-calculus. Rapport de Recherche RR-1702 INRIA Sophia-Antipolis.]] Boudol G. (1992) Asynchrony and the λ-calculus. Rapport de Recherche RR-1702 INRIA Sophia-Antipolis.]]
3. Mobile ambients. Foundations of System Specification and Computational Structures;Cardelli L.;LNCS,2000
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献