A new algorithm for the largest compositionally progressive solution of synchronous language equations
Tiziano Villa, S. Zharikova, Nina Vladimirovna Yevtushenko, Robert K. Brayton, Alberto Luigi Sangiovanni-Vincentelli · 2007
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show that if a synchronous FSM equation has a compositionally progressive solution, then the equation has the largest compositionally progressive solution. We provide an algorithm to compute the largest compositionally progressive solution that splits states of the largest solution and then removes those inducing a non-progressive composition.