2016
DOI: 10.1007/978-3-319-48314-6_2
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Networks of Finite State Machines

Abstract: Like distributed systems, biological multicellular processes are subject to dynamic changes and a biological system will not pass the survival-of-the-fittest test unless it exhibits certain features that enable fast recovery from these changes. In most cases, the types of dynamic changes a biological process may experience and its desired recovery features differ from those traditionally studied in the distributed computing literature. In particular, a question seldomly asked in the context of distributed digi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…For example, in Network Constructors [28] nodes move around randomly due to the dynamicity of the environment and when two of them interact the protocol can decide whether to establish a connection between them; that is, the protocol has some implicit control of the system's dynamics. Another passive model, inspired from biological multicellular processes, was recently proposed by Emek and Uitto [18]. Most models from the theory of algorithmic self-assembly, like the Abstract Tile Assembly Model (aTAM) [35,29], fall also in this category.…”
Section: Puzzlesmentioning
confidence: 99%
“…For example, in Network Constructors [28] nodes move around randomly due to the dynamicity of the environment and when two of them interact the protocol can decide whether to establish a connection between them; that is, the protocol has some implicit control of the system's dynamics. Another passive model, inspired from biological multicellular processes, was recently proposed by Emek and Uitto [18]. Most models from the theory of algorithmic self-assembly, like the Abstract Tile Assembly Model (aTAM) [35,29], fall also in this category.…”
Section: Puzzlesmentioning
confidence: 99%
“…Their main focus was on distributed problems that can be solved in sub-diameter (specifically, log O(1) n) time including MIS, tree coloring, coloring bounded degree graphs, and maximal matching. This remained the case also in [EU16], where Emek and Uitto studied SA algorithms for the MIS problem in dynamic graphs. In contrast, the current paper considers the k-leader selection problem -an inherently global problem that requires Ω(D) time.…”
Section: Additional Related Literaturementioning
confidence: 88%