2014
DOI: 10.1134/s0005117914060083
|View full text |Cite
|
Sign up to set email alerts
|

Extracting complexes that ensure sufficient structural conditions for system mutual informational agreement in multicomplex systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…This paper, as well as [1], presents the sufficient conditions for attaining the mutual information system agreement (MISA) in the multicomplex systems computing in parallel the set of interacting tasks with the given fault-tolerance characteristics both for solution of each of the tasks by its replication in the complex and for the environment of mutual exchanges between each pair of tasks.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…This paper, as well as [1], presents the sufficient conditions for attaining the mutual information system agreement (MISA) in the multicomplex systems computing in parallel the set of interacting tasks with the given fault-tolerance characteristics both for solution of each of the tasks by its replication in the complex and for the environment of mutual exchanges between each pair of tasks.…”
Section: Discussionmentioning
confidence: 99%
“…Let from the system digraph G extracted be two disjoint complexes φ k (k = i, j) with T k , H k = (X k ∪ P k , D k ), X k , N k = P k ∪ Q k , where T k is the subdigraph of the complex φ k , H k = (X k ∪ P k , D k ) is the subdigraph from T k homeomorphic to the complete digraph where X k is the set of basic vertices, P k is the set of separating vertices, and D k is the set of arcs [1]. Additionally, let the subdigraph R φ i ↔φ j = G R φ i ↔φ j of the domain of intercomplex exchange T i and T j such that, first,R φ i ↔φ j ∩T i = ∅ andR φ i ↔φ j ∩T j = ∅ and, second, a message from any vertex of T i (T j ) to any vertex of T j (T i ) must follow only a path belonging to the subdigraph G D φ i ↔φ j (T i ∪R φ i ↔φ j ∪T j ) be defined in G. Let us assume that the maximum possible number μ i↔j of faulty vertices belonging to this subdigraph be defined for the subdigraph R φ i ↔φ j .…”
Section: Extraction Of Misa Structural Environmentmentioning
confidence: 99%
See 3 more Smart Citations