Conclusions and Open Problems - The Unknown Component Problem: Theory and Applications - page 284

be interesting to study the level of system “granularity” at which the method is
effective, and to interplay hierarchical decomposition with full flexibility at the
feasible scale.
2. How to select a behavior from the largest solution that yields the best replacement
of the component to redesign under appropriate metrics, e.g., in sequential
synthesis the cost functions are area, delay, etc. In case of FSM equations with
respect to strict equality it is a problem even to extract an FSM solution itself.
3. Extend BALM to solve equations whose specifications are expressed with more
general

conditions than co-Buchi ones.
4. Study language equations over other types of formalisms widely used in the
discrete event system community, like Petri Nets.
5. Develop further the theory of realizability and synthesis for specifications
expressed by classes of formulas in temporal logic of practical relevance.

!

Acknowledgments 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.