Conclusions and Open Problems
The problem of finding an unknown component in a network of components in order to satisfy a global system specification was addressed. Abstract language equations of the type A ∙ X ⊆ C and A ◇X ⊆ C were investigated, where ∙ and ◇are operators of language composition. The most general solution was computed and various types of constrained solutions were studied. Then specialized language equations were introduced, such as regular and FSM language equations. The maximum subsets of them, closed with respect to various language properties, were studied; in particular the largest compositional solutions were studied.
Robert Brayton, Alan Mishchenko, Nina Yevtushenko and Tiziano Villa gratefully acknowledge the support of the following NATO travel grants: Collaborative Linkage Grant. No. 971217, Collaborative Linkage Grant CBP.NR.CLG 982314.
Tiziano Villa was partly supported by the EU projects FP7-IST-1-217069 COCONUT and FP7-ICT-223844 CON4COORD.
Nina Yevtushenko was partly supported by RFBR_NNC grants No. 06-08-89500 and 10-08-92003, and by a COOPERINT travel grant of the University of Verona.
Robert Brayton and Alan Mishchenko were partly supported by NSF contracts CCR-0312676 and CCF-0702668.
Alexandre Petrenko was partly supported by NSERC (Grant OGP0194381).
Alberto Sangiovanni-Vincentelli was partly supported by the Gigascale Systems Research Center and by the Multiscale System Center, two of five research centers funded under the Focus Center Research Program, a Semiconductor Research Corporation program.