On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations

In this paper we study systems of fuzzy relation inequalities and equations of the form U ∘ V i ≤ V i ∘ U ( i ∈ I ) , where U is an unknown and V i ( i ∈ I ) are given fuzzy relations, the dual systems V i ∘ U ≤ U ∘ V i ( i ∈ I ), their conjunctions, the systems of the form U ∘ V i = V i ∘ U ( i ∈ I ), and certain special types of these systems. We call them weakly linear systems. ch weakly linear system, with a complete residuated lattice as the underlying structure of truth values, we prove the existence of the greatest solution, and we provide an algorithm for computing the greatest solution, which works whenever the underlying complete residuated lattice is locally finite. Otherwise, we determine some sufficient conditions under which the algorithm works. The algorithm is iterative, and each its single step can be viewed as solving of a particular linear system. linear systems emerged from the fuzzy automata theory, but we show that they also have important applications in other fields, e.g. in the concurrency theory and social network analysis.