Self-assembling trees

DOI10.1016/J.ENTCS.2006.11.017MaRDI QIDQ2866313zbMATH OpenOpenAlexFDO

Authors Vincent Danos, Jean Krivine, Fabien Tarissan

Publication date 13 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.11.017

zbMATH Keywords

CCSdistributed consensusRCCSself assembling

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Recommendations

• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Self-assembling graphs
• scientific article; zbMATH DE number 4035159
• A note on causal trees and their applications to CCS

Cites work

• A calculus of mobile processes. II
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Formal molecular biology
• Foundations of Software Science and Computation Structures
• General reversibility
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 4119615 (Why is no real title available?)

Cited in

(5)

• Static versus dynamic reversibility in CCS
• Self-assembling graphs
• General reversibility
• A verification technique for reversible process algebra
• Contextual equivalences in configuration structures and reversibility

Describes a project that uses

Uses Software

• MWB

This page was built for publication: Self-assembling trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866313)