EA/AE-Eigenvectors of Interval Max-Min Matrices

: Systems working in discrete time (discrete event systems, in short: DES)—based on binary operations: the maximum and the minimum—are studied in so-called max–min (fuzzy) algebra. The steady states of a DES correspond to eigenvectors of its transition matrix. In reality, the matrix (vector) entries are usually not exact numbers and they can instead be considered as values in some intervals. The aim of this paper is to investigate the eigenvectors for max–min matrices (vectors) with interval coefﬁcients. This topic is closely related to the research of fuzzy DES in which the entries of state vectors and transition matrices are kept between 0 and 1, in order to describe uncertain and vague values. Such approach has many various applications, especially for decision-making support in biomedical research. On the other side, the interval data obtained as a result of impreciseness, or data errors, play important role in practise, and allow to model similar concepts. The interval approach in this paper is applied in combination with forall–exists quantiﬁcation of the values. It is assumed that the set of indices is divided into two disjoint subsets: the E-indices correspond to those components of a DES, in which the existence of one entry in the assigned interval is only required, while the A-indices correspond to the universal quantiﬁer, where all entries in the corresponding interval must be considered. In this paper, the properties of EA/AE-interval eigenvectors have been studied and characterized by equivalent conditions. Furthermore, numerical recognition algorithms working in polynomial time have been described. Finally, the results are illustrated by numerical examples.


Introduction
Matrices in max-min algebra (fuzzy matrices), in which the binary operations of addition and multiplication are replaced by binary operations of maximum and minimum, are useful when modeling fuzzy discrete dynamic systems. They are also useful for graph theory, scheduling, knowledge engineering, cluster analysis, fuzzy systems and when describing the diagnosis of technical devices [1,2] or medical diagnosis [3]. The problem studied in [3] leads to the problem of finding the greatest invariant of the fuzzy system.
Fuzzy DES combine fuzzy set theory with discrete events systems and are represented by vectors and matrices having entries between 0 and 1 and describing uncertain and vague values. The papers [4,5] are devoted to a generalization of DES into fuzzy DES and spreading optimal control of discrete event systems to fuzzy discrete event systems. The authors of [6] deal with predictability in fuzzy DES. In particular, these papers are motivated by an ambition to clear a difficulty with vagueness and subjectivity in real medical applications. The other possibility how to treat the possible inaccuracy of DES entries is to use interval data in combination with forall-exists quantification of values. Namely, some elements of the interval vector and the interval matrix are taken into account for each value of the interval, and some of them are only considered for at least one value. This approach allows to obtain alternative solutions.
The research of fuzzy algebra is also motivated by max-plus interaction discrete-events systems (DESs) whereby applications on the system of processors and multi-machine interactive production process were presented in [7,8], respectively. In these systems, we have n entities (e.g., processors, servers, machines, etc.) which that work in stages. In the algebraic model of their interactive work, the entry x i (k) of the state vector x(k) represents the start-time of the kth stage on entity i, i = 1, . . . , n, and the entry a ij of the transition matrix encodes the influence of the work of entity j in the previous stage on the work of entity i in the current stage. The system is assumed to be homogeneous, in the sense that A does not change from stage to stage.
Summing up all the influence effects multiplied by the results of previous stages, we have x i (k + 1) = j a ij ⊗ x j (k), where ⊕ = max and ⊗ = +. In max-plus algebra, the maximum is often interpreted as waiting until all works of the system are finished and all of the necessary influence constraints are satisfied. The problem of finding the vectors for which the DES reaches the steady state leads to the eigenproblem A ⊗ x = λ ⊗ x, and is one of the most intensively studied questions (see max-min case study in Section 3.2. Analogously, ⊗ = min in max-min algebra. The summing is then interpreted as computing the maximal capacity of the path leading to the next state of the system. Because the operations max and min do not create new values, a DES in max-min algebra necessarily comes to periodic repetition of the state vector (i.e., to a steady state) if the period is 1. The eigenproblem then has the form A ⊗ x = x. In comparison with the max-plus algebra, the eigenvalue λ is omitted (in other words, we assume that λ is equal to the maximal value I).
In practice, the values of the matrix entries obtained as a result of roundoff, truncation, or data errors are not exact numbers and they are usually contained in some intervals. Interval arithmetic is an efficient way to represent matrices in a guaranteed way on a computer. Meanwhile, fuzzy algebra is a convenient algebraic setting for some types of optimization problems, see [9]. Matrices and vectors with interval entries play important role in practice. They can be applied in several branches of applied mathematics, as for instance, a solvability of systems of linear interval equations in classical linear algebra [10] and in max-plus algebra [11] or the stability of the matrix orbit in max-min algebra [12,13].
The motivation for the basic questions studied in this paper comes from an investigation of the steady states of max-min systems with interval coefficients. Suppose that X is an interval vector and A is an interval matrix, then X is called a strong eigenvector of A if A ⊗ x = x holds for every x ∈ X and for every A ∈ A. The eigenvectors correspond to steady states, and it may happen in reality that this interpretation-with the universal quantifier for every index i ∈ N and for every pair (i, j) ∈ N × N-is too strong for all of the entries.
In other words, in some model situations only the existence of some Hence, we assume that X and A can be split into two subsets according to the exists/forall quantification of its interval entries; that is, X = X ∃ ⊕ X ∀ or A = A ∃ ⊕ A ∀ (or both splittings simultaneously) take place.
According to the first two cases, the properties of various types of the strong EA/AE-eigenvectors, or the EA/AE-strong eigenvectors, are studied in this paper. In addition, their characterizations by equivalent conditions are given. Moreover, polynomial recognition algorithms for the described conditions are presented. The mixed case (the EA/AE-strong EA/AE-eigenvectors) is briefly considered without recognition algorithms.
Related concepts of robustness (when an eigenvector of A is reached with any starting vector) and strong robustness (when the greatest eigenvector of A is reached with any starting vector) in fuzzy algebra were introduced and studied in [14,15]. Equivalent conditions for the robustness of interval matrix were presented in [11] and efficient algorithms for checking of strong robustness were described in [16]. The papers by [12,13] deal with AE/EA robustness of interval circulant matrices and X AE /X EA robustness of max-min matrices. Polynomial procedures for the recognition of weak robustness were described in [15].
The rest of this paper is organized as follows. The next section contains the basic definitions and notation. Sections 3 and 4 deal with the definitions and equivalent conditions for the EA/AE-eigenvectors. In particular, Section 3 is divided into two subsections, where Section 3.1 contains the methodology and Section 3.2 presents a study case application based on a numerical example. Section 5 describes the strong EA/AE-eigenvectors. Meanwhile, Section 6 is devoted to characterization of the necessary and sufficient conditions for the EA/AE-strong eigenvectors. Finally, the generalization to the mixed case of EA/AE-strong EA/AE-eigenvectors is briefly sketched in Appendix A.

Preliminaries and Basic Definitions
Let (B, ≤) be a bounded linearly ordered set with the least element in B denoted by O and the greatest element denoted by I. For given natural numbers m, n, we use the notation M = {1, 2, . . . , m} and N = {1, 2, . . . , n}, respectively. The set of m × n matrices over B is denoted by B(m, n), the set of n × 1 vectors over B is denoted by B(n) and, for α ∈ B, the constant vector (α, . . . , α) T is denoted by α .
The max-min algebra is defined as a triple (B, ⊕, ⊗), where a ⊕ b = max(a, b) and a ⊗ b = min(a, b). The operations ⊕, ⊗ are extended to the matrix-vector algebra over B by the direct analogy to the conventional linear algebra. If each entry of a matrix A ∈ B(m, n) (a vector x ∈ B(n)) is equal to The ordering from B is naturally extended to vectors and matrices. For example, for x = (x 1 , . . . , x n ) T ∈ B(n) and y = (y 1 , . . . , y n ) T ∈ B(n) we write x ≤ y, if x i ≤ y i holds for each i ∈ N.
For A, A ∈ B(n, n), A ≤ A and x, x ∈ B(n), x ≤ x, the interval matrix A with bounds A, A and the interval vector X with bounds x, x are defined as follows In the rest of this paper we assume that subsets N ∃ , N ∀ ⊆ N are given with N = N ∃ ∪ N ∀ and N = N ∃ ∩ N ∀ = ∅. In other words, we consider a partition N = {N ∃ , N ∀ }. If i ∈ N ∃ (i ∈ N ∀ ), then we say that the index i is associated with the existential (universal) quantifier.
Using the given partition N = {N ∃ , N ∀ }, we can split the interval vector X as X ∀ ⊕ X ∃ , where X ∀ = [x ∀ , x ∀ ] is the interval vector comprising the universally quantified entries and X ∃ = [x ∃ , x ∃ ] concerns the existentially quantified entries. In the other words, every vector x ∈ X can be written in the form Then subvectors X ∃ and X ∀ have the form For given A ∈ B(n, n), x ∈ B(n) we say that x is eigenvector of A, if In the rest of this paper, we assume that a partition N = {N ∃ , N ∀ } is given. The corresponding subvectors X ∃ , X ∀ and entries will always be related to this fixed N, without explicit formulation. The same is true for the EA/AE-eigenvectors that are defined as follows.

Definition 2.
Let matrix A ∈ B(n, n) and interval vector X = [x, x] ⊆ B(n) be given. We say that X is All matrices belonging to A and vectors belonging to X can be represented as max-min linear combinations of so-called generators, which are defined as follows. For every i, j ∈ N, A (ij) ∈ B(n, n) and x (i) , x [i] , ∈ B(n) are defined by putting, for every k, l ∈ N, Lemma 1. Let x ∈ B(n) and A ∈ B(n, n). Then, Proof. For the proof of statement (i), let us suppose that x ∈ X; that is, the inequalities It can be easily verified that i∈N β i ⊗ x (i) = x. The proof of statement (ii) is analogous.

Description of the Methodology
The first result is the characterization of an interval EA-eigenvector of a given (non-interval) matrix A, with the help of generators.
For fixed x ∃ define the auxiliary interval vectorX = (x 1 , . . . ,x n ) T as follows: Notice that vectorsx (i) ofX have the form or equivalently, It is easy to see that X is EA-eigenvector if and only if A ⊗x =x holds for eachx ∈X. By Lemma 1, an arbitrary vectorx ∈X is defined as the max-min linear combinationx = i∈N ∀ β i ⊗x (i) . We will then prove that the equality A ⊗x =x holds for eachx ∈X. Thus, we get The reverse implication is trivial.
The next result shows that the conditions in Theorem 1 can be equivalently formulated as the solvability condition of a system of two-sided max-min linear equations. Hence, the interval EA-eigenvectors of a given non-interval matrix can be recognized in polynomial time.
Without loss of generality, suppose that N ∃ = {1, 2, . . . , k} and N ∀ = {k + 1, k + 2, . . . , n}; that is, Define the matrices C, D ∈ B n(n − k + 1), n + 1 as follows We also have that the system if and only if the following equivalences hold true: because of β j = I for j ∈ N ∀ ∪ {n + 1}. Thus by Theorem 1, the assertion follows.
A polynomial algorithm for solving a general two-sided system C ⊗ β = D ⊗ β of max-min linear equations with C, D ∈ B(r, s), is presented in [17]. This method finds the maximum possible solution, β max , of the system. If this possible solution does not satisfy all of the conditions of the system, then the system is not solvable. In our case, the insolvability means that the considered X is not an EA-eigenvector of A. The computational complexity of the proposed algorithm is O(rs · min(r, s)).
Theorem 3. Suppose that we are given a matrix A and an interval vector X = [x, x]. The recognition problem of whether a given interval vector X of A is EA-eigenvector is then solvable in O(n 4 ) time.
Proof. According to Theorem 2, the recognition problem of EA-eigenvector of A is equivalent to recognizing whether the system C ⊗ β = D ⊗ β is solvable with x j ≤ β j ≤ x j for j ∈ N ∃ and β j = I for j ∈ N ∀ . In the general case, the computation of the needs O(rs · min(r, s)) time (see [17]). In our case, we have r = n(n − k + 1), s = n + 1; therefore, the computation of

Case Study Application of the Methodology Based on Numerical Example
Consider a data transfer system consisting of n computers and one server S. The computed data from computer c i , i ∈ N are sent to S whereby the corrected data have to return to c i . We assume that the connection between c i and S is only possible via one of n security processors p j , the connections between c i and p j are one-way connections, and the capacity of the connection between c i ∈ N and p j ∈ N is equal to a ij . Moreover, suppose that security processors p j ∈ N are connected with S by two-way connections with capacities x j in both directions. The data are transmitted in data packets, and every data packet is transmitted over just one connection as an inseparable unit. Therefore, the total capacity of the connection between i and S is equal to max j∈N {min{a ij , x j }}, that is, different used connections are comprised as the maximum of capacities (not as their sum).
The transfer from S to i is carried out via other one-way connections between security processors j ∈ N and i ∈ N with capacities between j and i equal to the constant I (the greatest element) if i = j, and equal to O (the least element), otherwise. Since the connections between S and j are two-way connections, the total capacity of the connection between S and i is equal to min{I, The goal is to find optimal capacities x j , j ∈ N such that the maximal capacity of all connections between i and S via j is equal to the maximal capacity of connections between S and i on the way back, that is, we have to choose x j , j ∈ N in such a way that max Consider a data transfer system which consists of 4 computers, 4 security processors and one server (see Figure 1). To find optimal capacities x j , j ∈ M = {1, 2, 3, 4} means to solve an eigenproblem for a matrix A. Then for B = [0, 10] and the matrix A we look for a solution of the equality A ⊗ x = x, or in matrix-vector form, we have One solution of the set of all solutions describing optimal capacities x j , j ∈ N of the data transfer system is vector x = (2, 2, 4, 5) T .
Assume now that the capacities x j , j ∈ N are limited by the lower bound x j and upper bound x j . Furthermore, we assume that not all of the processed data have the same importance: whereby, for some more important types of data, all values of the interval must be taken into account (all capacities of the data transfer system have to be involved in optimal solutions), and for some-less important data types-it is sufficient to be considered for at least one value (some value of these capacities of the data transfer system are optimal). In the above defined terminology, the optimal solution has to satisfy the definition of the EA-eigenvector of A.
For numerical illustration of this situation suppose that interval vector X has the form Then generators of X and its matrix-vector products can be computed as follows: By Theorem 2 we will show that X is EA-eigenvector. At first we shall construct matrices C and D and after that we shall solve the system with 2 ≤ β 1 ≤ 4; 2 ≤ β 2 ≤ 5; 10 ≤ β 3 ≤ 10; 10 ≤ β 4 ≤ 10; 10 ≤ β 5 ≤ 10.
To obtain a solution of the system (3), we use the Algorithm 1 presented in [17]. For the convenience of the reader, the algorithm is described in the original notation.
Let A, B ∈ B(m, n) be given matrices. Denotê Algorithm 1: Solving a general two-sided system.
Input: m, n, x. Output: , then x max := x, STOP; 2 Change notation so that a i (x) ≤ b i (x) for all i ∈ I; 3 Compute α(x), I < (α(x)), I = (α(x)); 4 Setx j := α(x) if j ∈ J(α(x)),x j := x j otherwise; 5 Ifx ∈ M(x), then x max :=x, STOP; 6 Put x :=x go to 2 ; end We will now apply the items of the Algorithm 2 to obtain the greatest solution of the system (3) whereby x, a i (x), b i (x) will be substituted by β, c i (β), d i (β), respectively: Algorithm 2: Solving a general two-sided system -example. The output of the Algorithm 2 is vector β max = (2, 2, 10, 10, 10) ∈ M(β), which is the greatest possible solution of the system (3). It is easy to verify that the possible solution β max satisfies all conditions of (3). In other words, β max is the solution, and we can conclude that X is an EA-eigenvector of A.

AE-Eigenvector
As in the previous section, we characterize an interval AE-eigenvector of a given non-interval matrix A with the help of generators. We recall that Proof. Suppose that X is not an AE-eigenvector of A; that is, We shall prove that either there is k ∈ N ∪ {n + 1} such that for each x ∃ ∈ X ∃ the inequality We will next analyze four cases: We will consider two subcases: and hence it follows that We will consider two subcases: The last theorem can be rewritten in the following form: Corollary 1. Let A ∈ B(n, n) and X = [x, x] be given. Then, X is AE-eigenvector of A if and only if The next two theorems show that the conditions in Corollary 1 can be equivalently formulated as the solvability conditions of a finite set of two-sided max-min linear systems. Consequently, the interval AE-eigenvectors of a given non-interval matrix can be recognized in polynomial time.

Theorem 5.
Let A ∈ B(n, n), X and i ∈ N ∀ ∪ {n + 1} be given. Then if and only if the system C(i) ⊗ β = D(i) ⊗ β with x j ≤ β j ≤ x j for j ∈ N ∃ and β k+1 = I is solvable, We also have the following equivalences for an arbitrary i ∈ N ∀ ∪ {n + 1} Similarly, we can prove the second part of the theorem.
Theorem 6. Suppose that we are given a matrix A ∈ B(n, n) and an interval vector X = [x, x]. Then, X is an AE-eigenvector of A if and only if for each i ∈ N ∀ ∪ {n + 1} the systems C(i) ⊗ β = D(i) ⊗ β and Proof. The assertion follows from Theorems 4 and 5.
Theorem 7. Suppose that we are given a matrix A ∈ B(n, n) and an interval vector The recognition problem of whether a given interval vector X is an AE-eigenvector of A is then solvable in O(n 4 ) time.
Proof. According to Theorem 6, the recognition problem of whether a given interval vector X is an AE-eigenvector of A is equivalent to recognizing if the system C( The computation of a system A ⊗ y = B ⊗ y needs O(rs · min(r, s)) time (see [17]), where A, B ∈ B(r, s). Therefore, the computation of at most n such systems is done in n · O(n 3 ) = O(n 4 ) time.

Strong Eigenvectors
In this section, we study various eigenvector types for the interval matrix A = [A, A] and the interval vector X = [x, x]. The basic type, which is called a strong eigenvector, is related to all matrices in A and all vectors in X. Further types, which are called strong EA-eigenvectors (strong AE-eigenvectors), are related to all matrices A ∈ A and to EA-eigenvectors (AE-eigenvectors) derived from X.

Definition 3. Let A, X be given. The interval vector X is called strong eigenvector of
Theorem 8. Let A, X be given. Then, X is a strong eigenvector of A if and only if A ⊗ x (k) = x (k) and A ⊗ x (k) = x (k) for all k ∈ N.
Proof. Let us assume that x ∈ X, A ⊗ x (k) = x (k) and A ⊗ x (k) = x (k) for all k ∈ N. Then, for arbitrary x ∈ X we get The assertion follows from the monotonicity of operations; that is, The converse implication is trivial.
• and a strong AE-eigenvector of A if Theorem 9. Let A, X be given. The following conditions are equivalent (i) X is a strong EA-eigenvector of A, Proof. These assertions follow from Theorems 1 and 8.
Theorem 10. Let A, X be given. The following conditions are equivalent (i) X is a strong AE-eigenvector of A, Proof. These assertions follow from Theorems 4 and 8.
Remark 2. By Theorems 9 and 10, the verification of whether (i) X is a strong EA-eigenvector, (ii) X is a strong AE-eigenvector, reduces to finding a vector x ∃ ∈ X ∃ satisfying some linear max-min equations, similar to Theorems 2 and 6. Hence, the recognition problem for these types of strong eigenvectors is polynomially solvable.

EA/AE-Strong Eigenvectors
In the previous sections, we worked with a fixed partition N = {N ∃ , N ∀ }, with N = N ∃ ∪ N ∀ and N = N ∃ ∩ N ∀ = ∅. In other words, every index i ∈ N is associated either with the existential, or with the universal quantifier. According to partition N, the interval vector X is presented as a sum of subintervals X ∃ ⊕ X ∀ . The interpretation of this partition is such that, for technical reasons, the vector entries in subinterval X ∃ only require the existence of one possible value A similar interpretation can be applied to the matrix entries. Suppose that each interval of A is associated either with the universal or with the existential quantifier. We can then split the interval matrix as A = A ∀ ⊕ A ∃ , where A ∀ is the interval matrix comprising universally quantified coefficients and A ∃ concerns existentially quantified coefficients.

Definition 5. Let A, X be given. Interval vector X is called
• EA-strong eigenvector of A if there is A ∃ ∈ A ∃ such that for any A ∀ ∈ A ∀ the vector X is a strong eigenvector of A ∃ ⊕ A ∀ , • AE-strong eigenvector of A if for any A ∀ ∈ A ∀ there is A ∃ ∈ A ∃ such that X is a strong eigenvector of A ∃ ⊕ A ∀ .

EA-Strong Eigenvector
Theorem 11. Let A, X be given. Then, X is an EA-strong eigenvector of A if and only if By monotonicity of the operations ⊕ and ⊗ for an arbitrary matrix A ∀ ∈ A ∀ , we get The reverse implication trivially holds.
Theorem 12. Let A, X be given. Then, X is an EA-strong eigenvector of A if and only if belongs to X; and if x ∈ X, then we Similarly, we can prove the second equality and by Theorem 11 the assertion follows. The reverse implication trivially holds.
The last theorem enables us to check the equivalent conditions of Theorem 12 in practice, whereby are joined into one system of equalities.
Theorem 13. Let A, X be given. Then X is EA-strong eigenvector of A if and only if the systemÃ ⊗ α =x has a solution α such that a ij ≤ α ij ≤ a ij and α k+1 = I.
Proof. The systemÃ ⊗ α =x is solvable if and only if there is a vector α such that α ij ⊗ A (ij) and by Theorem 12 the assertion holds true.
Theorem 14. Suppose that we are given a matrix A and interval vector X = [x, x]. The recognition problem of whether a given interval vector X is EA-strong eigenvector of A is solvable in O(n 5 ) time.
Proof. According to Theorem 13, the recognition problem of whether a given interval vector X is EA-strong eigenvector of A is equivalent to recognizing if the systemÃ ⊗ α =x has a solution α with a ij ≤ α ij ≤ a ij and α k+1 = I. The computation of a system A ⊗ y = b needs O(rs · min(r, s)) time (see [18]), where A ∈ B(r, s), b ∈ B(r). Therefore, the computation of such systems is done in O(n 2 · n 2 · n) = O(n 5 ) time.

AE-Strong Eigenvector
Proof. Suppose that for A ∀ there is B ∃ ∈ A ∃ such that for all x ∈ X the equality (B ∃ ⊕ A ∀ ) ⊗ x = x holds true and for A ∀ there is C ∃ ∈ A ∃ such that for all x ∈ X the equality (C ∃ ⊕ A ∀ ) ⊗ x = x is fulfilled. Moreover, assume that x ∈ X is arbitrary but fixed. Then, for any i ∈ N there is k, l ∈ N such that the following holds for any v ∈ N. We will prove that for an arbitrary but fixed matrix Put A ∃ := B ∃ . Then, there is r ∈ N such that Consider two cases.
The reverse inequality follows from the monotonicity of operations Because the reverse inequality trivially follows from (4), the equality (( The reverse implication is trivial.
A ∃ ∈ A ∃ such that for and fixed x ∈ X we have and by Theorem 15 the implication follows. The reverse implication trivially holds true.
Proof. Suppose that v ∈ N and A ∀ ∈ A ∀ G are fixed. The system C( is solvable if and only if there is a vector α such that k i,j=1 with a ij ≤ α ij ≤ a ij and α k+1 = I. Put A ∃ = k i,j=1 α ij ⊗ A (ij) and by Theorem 16 the assertion holds true. Theorem 18. Let A, X be given. The recognition problem of whether a given interval vector X is an AE-strong eigenvector of A is solvable in O(n 5 ) time.
Proof. According to Theorem 17, the recognition problem of whether a given interval vector X is an AE-strong eigenvector of A is equivalent to recognizing if the system C(A ∀ , v) ⊗ α = x (v) has a solution α with a ij ≤ α ij ≤ a ij and α k+1 = I. The computation of a system A ⊗ y = b needs O(rs · min(r, s)) time (see [18]), where A ∈ B(r, s), b ∈ B(r). Therefore, the computation of such systems is done in n · O(n · n 2 · n) = O(n 6 ) time.

Conclusions
In this paper, we have presented the properties of steady states in max-min discrete event systems. This concept, in connection with inexact entries and its exists/forall quantification, represents an alternating version to fuzzy discrete events systems which are using vectors and matrices with entries between 0 and 1, and are describing uncertain and vague values. The practical significance of this approach is that some elements of the vector X and the matrix A are taken into account for all values of the interval (corresponding to A-index), and some of them are only considered for at least one value (corresponding to E-index).
The concept of various types of the strong EA/AE-eigenvectors and the EA/AE-strong eigenvectors have been studied. In addition, their characterizations by equivalent conditions are given. All findings have been formally analyzed with a target to estimate the computational complexity of checking the obtained equivalent conditions. The results have been illustrated by an application of the obtained methodology on a numerical example.
The investigation of AE/EA concepts for steady state of discrete events systems with interval data has brought new efficient equivalent conditions. There is a good reason to continue the study of exists/forall quantification method for tolerable, universal and weak eigenvectors which are still unexplored and stay open for future research.
Author Contributions: All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding: This research was funded by Czech Science Foundation (GAČR), grant number 18-01246S.

Conflicts of Interest:
The authors declare no conflict of interest. The funders had no role in the design of the study, or in the decision to publish the results.

Appendix A
The idea of EA/AE-splitting the interval vector (matrix) X (A) in the form X ∃ ⊕ X ∀ (A ∃ ⊕ A ∀ ), can be considered simultaneously using partitions N = {N ∃ , N ∀ } andÑ = {Ñ ∃ ,Ñ ∀ }. By combining both approaches, the following four notions can be defined.
Definition A1. Let A, X be given. Then X is called • an EA-strong EA-eigenvector of A if there is A ∃ ∈ A ∃ such that for each A ∀ ∈ A ∀ interval vector X is an EA-eigenvector of A ∃ ⊕ A ∀ , • an EA-strong AE-eigenvector of A if there is A ∃ ∈ A ∃ such that for each A ∀ ∈ A ∀ interval vector X is an AE-eigenvector of A ∃ ⊕ A ∀ , • an AE-strong EA-eigenvector of A if for each A ∀ ∈ A ∀ there is A ∃ ∈ A ∃ such that interval vector X is an EA-eigenvector of A ∃ ⊕ A ∀ , • an AE-strong AE-eigenvector of A if for each A ∀ ∈ A ∀ there is A ∃ ∈ A ∃ such that interval vector X is an AE-eigenvector of A ∃ ⊕ A ∀ .
Every of these notions can be characterized in a similar way as that used in the previous two sections: Theorems 11 and 12,or Theorems 15 and 16. For the sake of brevity, only the first notion will be discussed here. The remaining cases are analogous.
Theorem A1. Let A, X be given. Then, interval vector X is an EA strong EA-eigenvector of A if and only if Proof. (⇐) The assertion follows from the monotonicity of the operations; that is, The converse implication is trivial.
Theorem A2. Let A, X be given. Then, interval vector X is an EA strong EA-eigenvector of A if and only if Proof. This assertion follows from Theorem 1 and Theorem A1.
Remark A1. In view of Theorem A2, the verification of whether or not X is an EA-strong EA-eigenvector of A requires us to find a vector x ∃ ∈ X ∃ and a matrix A ∃ ∈ A ∃ satisfying some two-sided max-min quadratic systems. This recognition problem and the analogous problems for remaining cases in Definition A1 have not been studied in this paper.