Self-assembling Trees

DOI10.1016/j.entcs.2006.11.017zbMath1277.68176OpenAlexW2121949103MaRDI QIDQ2866313

Fabien Tarissan, Vincent Danos, Jean Krivine

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

distributed consensusCCSRCCSself assembling

Mathematics Subject Classification ID

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

Related Items (5)

A Verification Technique for Reversible Process Algebra ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Self-assembling graphs ⋮ Static versus dynamic reversibility in CCS ⋮ General Reversibility

Uses Software

• MWB

Cites Work

• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. II
• Formal molecular biology
• General Reversibility
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Foundations of Software Science and Computation Structures

This page was built for publication: Self-assembling Trees