Sciweavers

FORTE
2003

Progressive Solutions to a Parallel Automata Equation

13 years 5 months ago
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.
Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where FORTE
Authors Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko, Gregor von Bochmann
Comments (0)