Progressive Solutions to a Parallel Automata Equation
- Cite this paper as:
- Buffalov S., El-Fakih K., Yevtushenko N., Bochmann G.. (2003) Progressive Solutions to a Parallel Automata Equation. In: König H., Heiner M., Wolisz A. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2003. FORTE 2003. Lecture Notes in Computer Science, vol 2767. Springer, Berlin, Heidelberg
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 \(A \Diamond X \cong C\). We present algorithms for deriving the largest progressive solution to the equation that combined with A does not block any possible action in C and we introduce a new simulation relation between automata in order to characterize all progressive solutions.