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 A ♦ X C. 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. © 2006 Elsevier B.V. All rights reserved.

• Type: Conference
• Year: 2003
• Where: FORTE
• Authors: Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko, Gregor von Bochmann
• Keywords: FORTE 2003, FORTE 2007, Largest Progressive Solution, Parallel Automata Equation, Progressive Solutions