Progressive solutions to a parallel automata equation

In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation . We present an algorithm for deriving a largest progressive solution to the equation that combined with A does not block any possible action in C and we establish conditions that allow us to characterize all progressive solutions.