POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Trustworthy Global Computing
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A prismoid framework for languages with resources
Theoretical Computer Science
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A verification environment for bigraphs
Innovations in Systems and Software Engineering
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions. The paper reports work in progress, seeking conditions on a bigraphical reactive system that are sufficient to ensure confluence; the conditions must deal with the way that bigraphical redexes can be intricately intertwined. The conditions should also be satisfied by the lambda calculus. After discussion of these issues, two conjectures are put forward.