Asynchronous Computability Theorem in Arbitrary Solo Models

: In this paper, we establish the asynchronous computability theorem in d -solo system by borrowing concepts from combinatorial topology, in which we state a necessary and sufﬁcient conditions for a task to be wait-free computable in that system. Intuitively, a d -solo system allows as many d processes to access it as if each were running solo, namely, without detecting communication from any peer. As an application, we completely characterize the solvability of the input-less tasks in such systems. This characterization also leads to a hardness classiﬁcation of these tasks according to whether their output complexes hold a d -nest structure. As a byproduct, we ﬁnd an alternative way to distinguish the computational power of d -solo objects for different d .


Introduction
Asynchronous computability, which means the solvability of tasks in asynchronous, failure-prone distributed systems, has been an active topic ever since 1985 when the well known FLP impossibility theorem was established [1]. There is a long line of work that deals with this topic for numerous tasks in different systems under various failure models [2][3][4][5][6][7][8][9][10]. However, only a pinch of results exist that characterize the asynchronous computability of general, rather than specific, tasks.
Such efforts date back to 1988, when Biran et al. [11] established a graph-theoretical sufficient and necessary condition for the solvability of distributed tasks in message-passing systems. Their method applies only if there is at most one crash failure of the process. Breakthrough was made in 1993 by three independent teams [5,6,12], among which Herlihy and Shavit [6] presented a topological framework for studying the asynchronous computability of general tasks in share-memory or message-passing systems with t ≥ 1 crash failures. This framework was then extended to a complete characterization of wait-free solvability of distributed tasks in shared-memory systems, namely, a task is solvable if and only if its specification is topologically compatible in some sense [7]. The characterization was further generalized in two directions. One direction is generalization to systems with arbitrary communication objects (not just shared-memory of message passing) [1,13], to arbitrary resilience (rather than one or n failures) [6,8,14], to arbitrary synchrony [15,16], or to Byzantine failures that may do the most malicious harm on the system [9,17,18]. The other direction is to characterize the relative hardness of Now, we recall the d-solo communication object CO d [r] proposed by Herlihy et al. [24], where integers 1 ≤ d ≤ n + 1 and r ≥ 1 stand for the solo-dimension and the round number, respectively. Roughly speaking, CO d [r] only allows processes in round r to communicate, and up to d of the processes can run in solo, i.e., each gets no information from its peers. The behavior of CO d [r] is depicted as follows. Let (Π 0 , . . . , Π z ) be an ordered pairwise-disjoint partition of a non-empty subset Π ⊆ Π, such that |Π 0 | ≤ d and Π i = ∅ for any 1 ≤ i ≤ z. It represents the following communication result: each process p j ∈ Π reaches round r and invokes CO d [r] on some value v j , and the invocation returns v j to p j if p j ∈ Π 0 , while it returns {v l |p l ∈ 0≤k≤i Π k } if p j ∈ Π i with i > 0. Intuitively, Π 0 is the set of processes that run in solo in round r. For more detail, refer to the literature [10].
A protocol is a distributed program consisting of the processes. A protocol is said to solve a task if the outputs of each execution conform with the specification of the task. Full-information protocols are widely studied, where each process keeps communicating without local computation until it decides. Full-information protocols play a key role in distributed computing, because they are universal in the sense that a task is solvable if and only if it can be solved by a full-information protocol. When processes communicate via d-solo object CO d , a full-information protocol has the form illustrated in Table 1. Here, decidable i (·) is a boolean function indicating whether or not the process p i can make a decision based on the local state ls i , and δ i (·) returns p i 's decision value. What we need to know is that p i makes a decision and δ i (·) returns just once if it can decide. (01) r i ← 0, ls i ← initial local state; (02) loop forever (03)

Topology Model of Distributed Computing
In this subsection, we review concepts of combinatorial topology briefly, and then we model distributed computing systems in terms of combinatorial topology. One can refer to [34][35][36][37] for further details.

Simplicial Complex and Simplicial Map
An abstract simplicial complex K, or complex for short, is a collection of non-empty subsets of a finite set. The complex is required to be closed under containment, meaning that if α ∈ K, then all non-empty subsets of α are included in K. A member of K is called a simplex. Given two simplexes α, β ∈ K, we say that α is a f ace of β if α ⊆ β, and we say that α is a proper f ace of β if α ⊂ β. Define the dimension of a simplex α to be dim(α) ||α|| − 1, where ||α|| stands for the cardinal number of the set α. The dimension of a simplicial complex is the highest dimension among its simplexes. We simply call an n-dimensional simplex α an n-simplex, and use the superscript form α n to indicate the dimension when needed. The notation is likewise defined on complexes. Any 0-simplex of a complex K is called a vertex of K, and we use V(K) to denote the set of vertices of K. A n-complex K is said to be pure, if any simplex α ∈ K is a face of some n-simplex β ∈ K. By default, we only consider pure complexes in this paper. Any complex K ⊆ K is called a subcomplex of K. Given a pure n-complex K, any (n − 1)-simplex α which is a face of a unique n-simplex is called a boundary simplex, and the subcomplex consisting of all boundary simplexes and their faces is called the boundary of K, denoted by ∂(K).
To ease understanding, one can equivalently view abstract simplicial complex K through the geometric lens which we call geometric simplicial complex. Bijectively map V(K) to an arbitrary set of affinely independent points in an Euclidean space. Each simplex naturally corresponds to the convex hull spanned by the images of its vertices. Seeing Figure 1, a vertex is 0-simplex, a line segment is a 1-simplex, a triangle is a 2-simplex and a tetrahedron is a 3-simplex. Putting the convex hulls together, we get a geometric realization |K| of K. Nevertheless, hereunder, we still adopt the definition of the abstract simplicial complex. Given complexes K and K , a map µ : V(K) −→ V(K ) is said to be a simplicial map from K to K if it map every simplex in K to a simplex in K . A map Ψ : K −→ 2 K is called a carrier map from K to K . Given a simplicial map µ and a carrier map from K to K , we say that µ is carried by Ψ if ψ(α) ∈ Ψ(α) for any simplex α ∈ K.
Let K and K be two complexes, we say that K is isomorphic to K if there exist simplicial maps f : K −→ K and g : K −→ K such that the compositions g • f and f • g are both identity maps.
Let K be a simplicial complexes and C be a finite set. We say K is C-chromatic if there is a map χ : V(K) −→ C such that χ(u) = χ(v) for any vertices u, v of a common simplex. We call χ a C-coloring of K and use χ(α) to denote the set of colors of the vertices of a simplex α. Suppose complexes K and K have C-colorings χ and χ , respectively. A map µ : For any integer n ≥ 0, we will use [n] to stand for the set {0, 1, 2, . . . , n}.
Let α be an n-simplex and χ be a C-coloring of α. The standard chromatic subdivision of α, denoted by Ch(α), is the n-complex Ch(α) constructed as follows: • c i = c j , and either S i ⊆ S j or S j ⊆ S i ; Note that Ch(α) has a natural C-coloring: color any vertex (c, S) in c. Hence Ch(α) is also C-chromatic. Figure 2 illustrates the barycenter subdivision which has a detailed description in [37], and the standard chromatic subdivision of a 2-simplex, viewing through the geometric lens.

Task Formalization
Formally, a distributed task T on n + 1 processes can be modeled as a triple (I, O, ∆), where I and O are pure n-complexes and ∆ is a carrier map from I to O. ∆ is dimension-preserving in the sense that for any α ∈ I, ∆(α) is a pure complex of dimension dim(α). The n-simplexes in the input complex I are such {(0, u 0 ), . . . , (n, u n )} where u i ranges over the input domain of process p i . Likewise for O, except that the values range over the output domains. With any vertex (i, x) colored by the color i, both I and O are [n]-chromatic complexes. ∆ must satisfies that Then, β ∈ ∆(α) means when only processes p i 0 , . . . , p i m participate in an execution, if each p i j gets input u j , it is eligible that each p i j ends with output v j for j ∈ [m].

Protocol Complex
Consider a full-information protocol P as shown in Table 1. Fix an input simplex α. In an execution, if each process p i finishes round k with local state ls i , the global state of P at the end of round k in this execution is modeled as the simplex β = {(i, ls i ) : 0 ≤ i ≤ m}, m ≤ n. We say that β is reachable from α by P. All such simplexes, together with all their faces, constitute the k-round protocol complex of P reachable from α, denoted by P k (α). Let k be the last round before making decision. Then complex P (I) α∈I P k (α) is called the protocol complex of P. Figure 4 illustrates the geometric view of the 1-round protocol complex of the full-information protocol on three processes. The dots are colored yellow, black and green to stand for the processes p 0 , p 1 and p 2 . Consider the communication objects CO d with d = 1, 2, 3, respectively. An arrow represents that the destination process has received the value communicated via CO d by the source process. Each filled triangle represents a 2-simplex, modeling a reachable global state. The collection of all the 2-simplexes in the left part of the Figure 4 represents 1-round protocol complex when the communication object is 1-solo. The middle part of Figure 4 shows the extra 2-simplexes that appear when the communication object changes from 1-solo to 2-solo. Hence, the simplexes in the middle and those in the left part of this figure form the 1-round protocol complex when d = 2 in CO d . If we further increase d to 3, one more 2-simplex appears, as illustrated in the right part of Figure 4, which represents an execution in which all of the three processes run in solo. Putting all the simplexes together, we get the 1-round protocol complex when CO 3 is used.

Chromatic Join
In this subsection, we mainly define a chromatic complex, a chromatic join, which can describe the execution of d-solo model accurately. Then we introduce a simple property of the complex.
Given two sets X 0 and X 1 with no intersection, call X 0 * X 1 the join of X 0 and X 1 if Let α be a chromatic simplex. Consider a non-empty set S ⊆ V(Ch(α)). Define the low-dimensional part L(S) {(c, T) ∈ S : dim(T) = 0}, and the high-dimensional part H(S) S \ L(S). We say that S is compatible if both the following conditions hold: Roughly speaking, S, if compatible, stands for the global state resulted from a 1-round execution of the full-information protocol, where processes in L(S) run in solo.

Remark 1.
We can regard S as a join L(S) * H(S) of L(S) and H(S) that are subsets of V(Ch(α)) for any element S ∈ D d (α); In the definition of chromatic d-join, S can be such that ||L(S)|| ≤ 1. This implies that Ch(α) ⊆ D d (α).
Now we extend the definition to complexes. Suppose K is a chromatic n-complex. Its chromatic d-join is defined to be D d (K) α∈K D d (α).
Proof of Lemma 1. We first show that D d (K) is closed under containment and intersection.
It is not hard to show that in each case of them, we can regard β as a d-join of a subset of L(S) and a subset of H(S). It follows that β is in D d (α), and it is also in D d (K).
Let γ be any another simplex in D d (K). If the intersections of γ and β is not empty set, then it must be a common face of them. By the upper argument, we know that it is also in D d (K).
Then label each vertex (c, T) ∈ V(D d (K)) with c. From the definition of D d (K), it is obvious that this labeling is a coloring map of D d (K).
Throughout this paper, whenever coloring of D d (K) is mentioned, it always means the labeling in the proof.
is chromatic simplicial complex for any given chromatic simplex α, then we can regard D s d as a carrier map. On this ground, we define the carrier of a simplex in D s d (α).
Definition 2. Given a chromatic simplicial complex K, consider an arbitrary simplex that β ∈ D d (K). Let τ be the minimal simplex in K such that β ∈ D d (τ). Then τ is called β's carrier in K under carrier map D d , denoted by carrier(β, K). Inductively, we can define the carrier of β ∈ D s d (K), that is, carrier s (β, K) = carrier s−1 (carrier(β, D s−1 (K)), K).
The next lemma indicates that the d-join D s d (·) preserves some connectedness property.
If there is a color-preserving simplicial map f : D k d (K) −→ K for non-negative integers k and d, there is a color-preserving simplicial map g : Let β is any n-simplex of D d (α), since D d (α) is chromatic complex by Lemma 1, then we can assume that β = {(i, T r i )} i∈ [n] . It follows that which is an n-simplex in K . Since β is chosen arbitrarily, then g α is a color-preserving simplicial map Assume α is another n-simplex of D k d (K) and τ is the common face of α and α , then It follows that g α (D d (τ)) is equal to g α (D d (τ)) by former argument. As a result, all such maps agree on their intersections. We just constructed g = α∈D k d (K) g α then g is a color-preserving simplicial map such that for any simplex β of D k+1 d (K), g(β) is equal to g β (β), where β is carrier(β, D k d (K)). Note that α is arbitrary and D k+1 d (K) is D d (D k d (K)), it follows that g is a color-preserving simplicial map from D k+1 d (K) to K .

Remark 2.
Let us explain the relation of maps g α and g. Since we have shown that g α is a simplicial map for any α in D k d (K), then it is a "linear" map [38], which makes that the images of the intersection under g α and g β are the same if α has an intersection with β. Then we can regard g as an attaching map of all pieces g α .
By this lemma, we know that if there is a color-preserving simplicial map from D k d (K) to K , then there also exists a color-preserving simplicial map from D k d (K) to K for any integer k ≥ k.

Main Theorem
In this subsection, we first show the connection between protocol complex and chromatic d-join of the input complex, and then we prove one of main theorems.

Lemma 3.
When the input complex is I, the protocol complex P 1 (I) of any 1-round full-information protocol in d-solo model is exactly the chromatic d-join D d (I).
Proof of Lemma 3. The basic strategy of the proof is to show that there exists a one-to-one correspondence between the set of protocol complexes on I of any protocol P with 1-round and the once chromatic d-join of I in Definition 1, where I is the input complex colored by χ with colors [n]. Roughly speaking, we firstly show that given an input simplex of I and an execution of the protocol P arbitrarily, the output complex is a subcomplex of D d (I). Secondly, we need to show that given any simplex O of D d (I), there must exist an execution and an input simplex such that there is a possible output which corresponds to O.
Consider any maximal input n-simplex I = {x 0 , x 1 , . . . , x n } in I as an initial global state, where x i = (i, v i ), i ∈ [n] in which i and v i stand for the ID and the input value of a participating process p i . Let Π = {p i } i∈[n] be the set of processes that are coming from I. Consider any execution of protocol P with 1-round in d-solo object CO d . From the behavior of object CO d , factly gives a sequence of all processes along the order that run CO d , denoted by p t 0 p t 1 · · · p t n , where t j , j ∈ [n]. That is if p t i p t j then process p t i runs object CO d before p t j or both of them run concurrently. Define an ordered partition of Π by this sequence, denoted by {π 0 , π 1 , . . . , π q }, such that all processes in π j run object CO d concurrently and processes in π i run object CO d before processes in π j for 0 ≤ i < j ≤ q. It follows that processes that executing solo appear only in π 0 . Let π 0 be an empty set if there is no process that runs solo. Note that at most d processes run solo, then 0 ≤ |π 0 | ≤ d. Assume that all processes of Π finishing have returns, denoted by Note that if p i ∈ π 0 , process p i only see itself then l i = {(i, v i )} which is a 0-dimensional face of I, and if p i ∈ π s , 0 < s ≤ q, process p i will see all processes that run before and concurrently, then is a non-zero dimensional face of I. By the definition of standard chromatic subdivision, (i, l i ) ∈ V(Ch(I)) for any (i, l i ) ∈ S, then S ⊆ Ch(I).
Let L(S) be equal to {(i, l i ) ∈ S : dim(l i ) = 0} and let H(S) be complementary set of L(S) in S, then for any (i, l i ) ∈ L(S) and any (j, l j ), (r, l r ) ∈ H(S), we have l i ⊂ l j ⊆ l r or l i ⊂ l r ⊆ l j It follows that S is compatible. Note that ||L(S)|| ≤ d, then S is a d-join and in D d (I) by Definition 1. If not all processes have returns, that is, some processes may be faulty, then the returns S is a subset of S, for all processes participate and deposit their initial local state in object CO d . Then S is also a d-join and in D d (I). Since I and are arbitrary, then P 1 (I) ⊆ D d (I).
On the contrary, given any m-simplex α = {(j, T j )} j∈A of D d (I). Suppose α = carrier(α , I), then T j is a face of α for any j ∈ A . Let A = χ(α), then A ⊆ A. Let Π = {p i |i ∈ A} and let Π = {p i |i ∈ A }, then Π ⊆ Π.
Since α is a d-join, then it is compatible and it has form L(α ) * H(α ) with ||L(α )|| ≤ d, where L(α ) and H(α ) are the low-dimensional part and the high-dimensional part of α . And then for any vertex u ∈ L(α ), {u} H(α ) is a face of Ch(α). It follows that we can give a partition of the set of classes over all processes of Π , denoted {π 0 , π 1 , . . . , π s }, such that, if (i, T i ) ∈ L(α ) then we put p i into π 0 ; and for any two processes (c, T c ), (j, T j ) ∈ H(α ), if T c = T j then we put them in a same class π t with 0 < t ≤ s, and if T c ⊂ T j we put p c and p j into π s c and π s j such that 0 < s c < s j ≤ s.
Next, we will give an ordered partition of Π by Π .
Step 1. For any one together as a new class π 0 0 between π 0 and π 1 .
Step 2. For any one that is, there exists at least one process that is in {p x |x ∈ χ(T j )} but not in Π , then put together as a new class π (t−1) 0 between π t−1 and π t . After checking all elements of this partition of Π , we will get a new partition {π 0 , π 0 0 , π 1 , π 1 0 π 2 0 , π 2 , . . . , π s−1 , π s 0 , π s }. It is easy to show that this is a partition of Π, because α is the carrier of α and there must be a vertex (i, T i ) in Q such that T i = α by Definitions 1 and 2. By this ordered partition, we can construct an execution β such that when all processes finish the execution, the reachable simplex is α . Without loss of generality, we assume |π 0 | = 0. Step 1. Let all the processes in π 0 access object CO d firstly such that all processes have returns and return their inputs, denoted this collection of executions by β 0 ; Step 2. Let all the processes in π 0 0 access object CO d concurrently after π 0 , such that none of them has return, which represents that all of them are crash, denoted this collection of executions by β 0 0 ; Step 3. Along with this ordered partition, do the similar steps as step 1 and step 2, denoted these ordered collections of executions by β (j−1) 0 , β j for 1 < j ≤ s. Let β = β 0 β 0 0 β 1 β 1 0 · · · β s 0 β s be the composite of all executions, such that for each process in execution β x 0 there is no return, and for each process in execution β x there must be a return. If for some π i or π j 0 is an empty set, it needs just omit the corresponding executions in β. As a result, α is a reachable simplex under execution β. For any face of α, we just take the composite of the subset of corresponding executions. Since α is arbitrary, it follows that D d (I) is a subset of P 1 (I). From upper arguments, we can see that P 1 (I) is equal to D d (I).

Corollary 1.
When the input complex is I, the protocol complex P s (I) of any s-round full-information protocol in d-solo model is exactly the s-fold chromatic d-join D s d (I).
Proof of Corollary 1. Given arbitrary execution of protocol P with s rounds, we can model as a sequence 1 2 · · · s of executions, such that each process runs a protocol with at most one round in execution i . Then each return of a process after executing i is an input value of this process in execution i+1 , by Lemma 3 and Definition 1, P s (I) is equal to the s-fold chromatic d-join D s d (I). Proof of Theorem 1. From the Figure 5, we know that the protocol P solves the task (I, O, ∆) iff there exists a simplicial color-preserving decision map δ : P k (I) −→ O such that for every simplex S r ∈ I, and every simplex S r ∈ P k (S r ), 0 ≤ r ≤ n, δ( S r ) ∈ ∆(S r ). Suppose there exists a protocol that solves task T. By Corollary 1, the protocol complex is equal to D k d (I). Let µ = δ, which shows the necessity of the theorem. For sufficiency, suppose S r is any r-simplex in I, apply algorithm as Table 1 in d-solo model and after k-round, any output simplex will agree on a simplex in D k d (S r ). By hypothesis, there exists a simplicial map µ : D k d (S r ) −→ O. Then a process that chooses vertex v in D k d (S r ) then chooses as its output the value labeling µ(v). That is to say, this algorithm can solve this task.

Remark 3.
This theorem gives the topological characterization, he span that is a pair of a chromatic join and a color-preserving simplicial map, of the wait-free solvability of a given decision task in d-solo systems, which we can use to give us theoretical help in hardware design or early warning. Proof of Corollary 2. Suppose T is solvable in d 2 -solo model, then there is a color-preserving simplicial map µ from D k d 2 (I) to O for some integer k by Theorem 1. Note that D k d 1 (I) is a subcomplex of D k d 2 (I) for d 1 ≤ d 2 , then the restriction of µ on D k d 2 (I) is a carrier and color preserving simplicial map from D k d 1 (I) to O, by Theorem 1, T is solvable in d 1 -solo model, which is a contradiction.

Application
A standard input-less n-task T = (I, O, ∆) is a task of n + 1 processes. Specifically, I is a pure complex having only one n-simplex, implying that each process has no input; O has a subcomplex L which is isomorphic to the boundary of an n-simplex. If less than n + 1 processes participate in an execution, the output simplices must lie in L, otherwise, any simplex in O is eligible. For simplicity, we can use T = (O, L) to stand for T = (I, O, ∆). A standard input-less 2-task can be seen in Figure 3.
By Gafni and Koutsoupias in [23], we know that 2-task T is solvable in wait-free iterated immediately snapshot model if and only if L is contractible (i.e., there exists a continuous map from a 2-dimensional disk to |O| such that it maps the boundary of this disk to |L|) in O whose n + 1-dimensional homotopy group can be represented. However, we will see that it is not true in d-solo model, that is to say, it is too weak to derive the solvability of task T from the condition in which L is just contractible in O.
In this subsection, we mainly investigate the solvability of any standard input-less task, that is giving the necessary and sufficient conditions of solvability to these tasks, which also implies the classification of these tasks along their solvability in d-solo model. But before this, we need introduce the other topology space.
Intuitively, the standard chromatic subdivision of an n-simplex τ is an evolution of its barycentric subdivision, in which we need add the least new vertices in all but 0-dimensional faces of τ, such that each face is divided into more than one small pieces and each one is a chromatic simplex with the same colors and dimension of that face. However, in the next definition, we introduce a special chromatic subdivision in which the added vertices only appears in a face with its dimension at least k.

Definition 3.
Let α be an [n]-chromatic simplex and k be a non-negative integer. The k-type chromatic subdivision of α, denoted by E k (α), is a complex obtained from D k (α) by removing simplices having any vertex (c, T) with 1 ≤ dim(T) < k.

Remark 4.
If n < k, then E k (α) = α, that is, there is no any operation on α. If k = 0, 1 then E k (α) is equal to Ch(α) that is standard chromatic subdivision of α.
We can inductively define the s-fold k-type chromatic subdivision E s k (α) of α with that E s k (α) = E k (E s−1 k (α)) for any positive integer s. Similarily, if X is an [n]-chromatic n-complex, we can get the s-fold k-type chromatic subdivision of X, denoted by E s k (X) α∈X E s k (α). In addition, if s = 0, set E 0 k (X) = X. The Figure 6 is an example that shows 1-type and 2-type chromatic subdivisions of a 2-simplex. By definition, E s k (X) is a subcomplex of D s k (X). Hence, if there is a simplicial map from D s k (X) to some chromatic complexes Y, there is a simplicial map from E s k (X) to Y for a given chromatic complexes Y. The next lemma implies the situation vice versa, which is usually not right for a pair of general simplicial complexes. Lemma 4. Let X and Y be [n]-chromatic n-simplexes. For any integers k > 0 and s ≥ 0, there exists a color-preserving simplicial map from D s k (X) to E s k (Y).
Proof of Lemma 4. We will show that by induction. Suppose We will show that ψ 1 is a color-preserving simplicial map. Suppose τ is an arbitrary n-simplex in D k (X), then it is a k-join, that is, it is compatible and ||L(τ)|| ≤ k, then there are at most k vertices in τ such that dim(S) < k for each vertex (c, S) of them. By former Equation, ψ 1 (τ) ⊆ V(Ch(Y)). Note that ψ 1 is color-preserving and there are at most k vertices in ψ 1 (τ) such that dim( S) = 0 for each vertex (c, S) of them, then ψ 1 (τ) is compatible and ||L(ψ 1 (τ))|| ≤ k, and then ψ 1 (τ) ∈ D k (Y). Since each vertex of ψ 1 (τ) has form (i t , (i t , w i t )) with dim((i t , w i t )) = 0, or (i t , S r t ) with dim(S t i ) ≥ k, then there is no vertex (c, S) in ψ 1 (τ) such that 1 < dim(X ) < k, and then ψ 1 (τ) ∈ E k (Y). Since τ is arbitrary, it follows that ψ 1 is a color-preserving simplicial map.
Suppose that for t < s there is a color-preserving simplicial map ψ t : D t k (X) −→ E t k (Y). Consider t = s. Let τ be arbitrary n-simplex of D t k (X), where t = s − 1 < s. By assumption, there exists a color-preserving simplicial map ψ t from D t k (X) to E t k (Y), then the restriction ψ t | τ of ψ t on τ is also a color-preserving simplicial map from τ to E t k (Y). Since X and Y are arbitrary, set X = τ , Y = ψ t | τ (τ ), by the former argument, we know that there is a color-preserving simplicial map g τ from D k (τ ) to E k (ψ t | τ (τ )). As all such maps agree on their intersections, then we just constructed g = τ ∈D t k (X) g τ It follows that g is a color-preserving simplicial map from D s k (X) to E k (ψ t (D t k (X))). Note that ψ t (D t k (X)) is a subset of E t k (Y), then E k (ψ t (D t k (X))) is a subset of E s k (Y). Let I 0 be an inclusion map from E k (ψ t (D t k (X))) to E s k (Y), then it is a color-preserving simplicial map. Let ψ s = I 0 • g be the composite of I 0 and g, then ψ s is the color-preserving simplicial map from D s k (X) to E s k (Y). By now, we complete the induction.

Remark 5.
Let us explain what is the construction map ψ 1 . Since X and Y are chromtatic n-simplexes, then D k (X) is isomorphic to D k (Y). In other words, they are the same in topology. Because E k (Y) is a subcomplex of D k (Y), then ψ 1 can be regarded as a collapse map from D k (Y) to its subcomplex E k (Y) essentially. That is to say ψ 1 map a simplex to itself if the simplex is in both D k (Y) and E k (Y), otherwise ψ 1 collapses the simplex to one of its vertices. Corollary 3. Let X and Y be two arbitrary [n]-chromatic n-simplexes. If there is a color-preserving simplicial map from E s k (X) to Y for some non-negative integer s, there exists a color-preserving simplicial map from D s k (X) to Y.

Proof of Corollary 3.
Assume ϕ is the color-preserving simplicial map from E s k (X) to Y. By Lemma 4, there is a color-preserving simplicial map ψ from D s k (X) to E s k (X). Let be the composite of φ and ϕ, then h is a color-preserving simplicial map from D s k (X) to Y.
Suppose I n be a [n]-chromatic simplex with ∂I n = L 0 . Let F s k be the collection of all color-preserving simplicial maps that are from E s k (I n ) to any [n]-chromatic complex X n with a subcomplex L which is isomorphic to L 0 , such that f (E s k (L 0 )) = L for any f ∈ F s k .
Intuitively, the k-nest N k is a space of images of all color-preserving simplicial maps that are from s-fold k-type chromatic subdivision of a chromatic n-simplex to any chromatic n-complex for all non-negative integer s.
We say that a chromatic n-complex K holds k-nest structure which is bounded by a subcomplex L means that there exists a subcomplex K of K with boundary L , such that K is isomorphic to an element M ∈ N k .
Observation For the spectral sequence about nests N 0 = N 1 , N 2 , . . . , N n , if 1 ≤ i < j ≤ n, N i is larger than N j , that is, there is at least one element in N i but not in N j .
In fact, we can always construct an element that is in N i but not in N j for 1 ≤ i < j ≤ n. A simple example shows that the left complex of the Figure 7 is in N 1 but not in N 2 . Example 3. There are two chromatic 2-complexes in Figure 7 with color {P, Q, R}. The left one denoted by F, and the right one denoted by F . Each vertex has form C t , where C and t stand for color and some state of that vertex. The boundaries of them are the outer bold and black segments, denoted by L. There is no difficulty to show that F holds 2-nest structure, because we only take s = 1, X = I 2 which is a chromatic 2-simplex with color {P, Q, R}, then there is a natural color-preserving simplicial from E 2 (I 2 ) to F . However, for F, we can never find an integer s such that there is a color-preserving simplicial from E s 2 (I 2 ) to F. But they all hold 1-nest structure, because, L is always contractible and E 1 is the standard chromatic subdivision operation. Then there always exists a large enough integer s such that there is a color-preserving simplicial from E s 1 (I 2 ) to F and F by Lemma 2 of [23]. of the d-solo models, we can choose the corresponding d according to the actual demand. The other is that how to do application development of a given information exchange system. Such as how to detect the defects of the system and make early warning [46]. Some traditional ways may cost large mount of time or money and sometimes a result hardly convinces many people. Luckily, it seems to be easy, at least on a theoretical level, if we use the topological framework to construct a mechanism and then to analyze it. From this point, our framework has a far-reaching impact on the production and living. Furthermore, there should be more and more researchers who take part in the research that how to apply topological framework to real-life better.
Lastly, the chromatic join of a given chromatic complex itself is very interesting and it provides a way to generate a new chromatic complex from the original complex. Though the geometrical properties of the generated chromatic complex look more complicated than the original, their topological properties are similar. Roughly, if an input complex is isomorphic to an n-sphere, then the chromatic join of an input complex is isomorphic to a wedge sum of n-spheres, and the bigger d the more number of n-spheres in the wedge sum. So our research has a potential value to the studies of topology itself, especially in simplicial homotopy theory.

Conclusions
In this work, we develop an elegant theory, the Asynchronous Computability Theorem in arbitrary solo systems when we focus on just full-information protocol and crash-failure models, which can be used to characterize the computability of a given decision task in that systems. Later, we derive a simple necessary and sufficient conditions for the solvability of input-less tasks in d-solo systems. It is a fly in the ointment that we maybe concentrate little on the topological properties of the k-folds chromatic join d-join D k d (·) themselves and do not pay much attention to the general protocols and the byzantine models, because it seems that those properties are a little contribution to our main result, and the general protocols complexes or the byzantine models are quite complicated and are beyond the scope of our small paper. However, the byzantine failure model [9,17,18] and general protocol [47] play an important part in theoretical computer science, especially in distributed systems. So there are more meaningful research we should do in future work. Such as, how do we describe the protocol complexes of general protocols in d-solo systems clearly. What's the characterization of solvability of a decision tasks in that d-solo systems for the byzantine failure model? In addition, there is a little discussion on the practical application of our framework in this work. While the potential of applications and prospects are enormous, so there is much work we should do in that aspect in the future.