Self-assembling trees

DOI10.1016/J.ENTCS.2006.11.017zbMATH Open1277.68176OpenAlexW2121949103MaRDI QIDQ2866313FDOQ2866313

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

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

zbMATH Keywords

distributed consensusCCSRCCSself assembling

Mathematics Subject Classification ID

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

Cites Work

• Formal molecular biology
• General reversibility
• Title not available (Why is that?)
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• A calculus of mobile processes. II
• Title not available (Why is that?)
• Foundations of Software Science and Computation Structures

Cited In (5)

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

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)