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

127. V. Singhal, C. Pixley, A. Aziz, R.K. Brayton, Theory of safe replacements for sequential
circuits. IEEE Trans. Comp. Aided Des. 20 (2), 249-265 (2001)
128. V. Singhal, C. Pixley, A. Aziz, R.K. Brayton, Sequential optimization in the absence of global
reset. ACM Trans. Des. Autom. Electron. Syst. 8 (2), 222-251 (2003)
129. V. Singhal, Design Replacements for Sequential Circuits . PhD thesis, University of California,
Berkeley, March 1996. Tech. Report No. UCB/ERL M96/10.
130. P. H. Starke, Abstract Automata . (North-Holland Pub. Co.; American Elsevier Pub. Co., 1972)
131. Information Technology. Conformance testing methodology and framework, 1991.
132. J.W. Thatcher, J.B. Wright, Generalized finite automata with an application to a decision
problem of second-order logic. Math. Syst. Theor. 2 , 57-82 (1968)
133. N. Venkatraman, J. Hammer, On the control of asynchronous sequential machines with
infinitecycles.Int.J.Contr. 79 (7), 764-785 (2006)
134. M. Vetrova Designing and Testing FSM compensators . PhD thesis, Tomsk State University,
Russia, 2004. (in Russian)
135. T. Villa, T. Kam, R. Brayton, A. Sangiovanni-Vincentelli, Explicit and implicit algorithms for
binate covering problems. IEEE Trans. Comput. Aided Des. 16 (7), 677-691 (1997)
136. T. Villa, T. Kam, R. Brayton, A. Sangiovanni-Vincentelli, Synthesis of FSMs: logic optimiza-
tion (Kluwer Academic Publishers, Boston, 1997)
137. C. Wang, G. Hachtel, F. Somenzi, The compositional far side of image computation, in The
Proceedings of the International Conference on Computer-Aided Design , pages 334-340,
November 2003
138. G. Wang, A. Mishchenko, R. Brayton, A. Sangiovanni-Vincentelli, Synthesizing FSMs
according to co-B uchi properties. Technical Report UCB/ERL M05/13, EECS Department,
University of California, Berkeley, Apr 2005.
139. H.-Y. Wang and R.K. Brayton. Input don't care sequences in FSM networks. In The
Proceedings of the International Conference on Computer-Aided Design , pages 321-328,
November 1993
140. H.-Y. Wang, R.K. Brayton, Permissible observability relations in FSM networks, in The
Proceedings of the Design Automation Conference , pages 677-683, June 1994
141. H.-Y. Wang, R.K. Brayton, Multi-level logic optimization of FSM networks, in The Proceed-
ings of the International Conference on Computer-Aided Design , pages 728-735, November
1995
142. Y. Watanabe, R.K. Brayton, The maximum set of permissible behaviors for FSM networks, in
IEEE International Conference on Computer-Aided Design , pages 316-320, November 1993
143. Y. Watanabe, R.K. Brayton, State minimization of pseudo non-deterministic FSM's, in
European Conference on Design Automation , pages 184-191, March 1994
144. B.W. Watson, Implementing and using finite automata toolkits. Nat. Lang. Eng. 2 (4), 295-302
(1996)
145. E. Wolf, Hierarchical Models of Synchronous Circuits for Formal Verification and Substitu-
tion . PhD thesis, Stanford University, September 1995. Tech. Report No. CS-TR-95-1557
146. J.-M. Yang, J. Hammer, State feedback control of asynchronous sequential machines with
adversarial inputs. Int. J. Contr. 81 (12), 1910-1929 (2008)
147. N. Yevtushenko, I. Koufareva, Studying relations between nondeterministic Finite State
Machines. Technical report, Spectrum Publishers, Tomsk, 2001. (In Russian)
148. N. Yevtushenko, T. Villa, R. Brayton, A. Petrenko, A. Sangiovanni-Vincentelli, Composition-
ally progressive solutions of synchronous language equations, in International Workshop on
Logic and Synthesis , May 2003
149. N. Yevtushenko, T. Villa, R. Brayton, A. Petrenko, A. Sangiovanni-Vincentelli, Composition-
ally progressive solutions of synchronous FSM equations. Discrete. Event. Dyn. Syst. 18 (1),
51-89 (2008)
150. N. Yevtushenko, T. Villa, S. Zharikova, Solving language equations over synchronous and
parallel composition operators, in Proceedings of the 1st International Workshop on Theory
and Applications of Language Equations , ed. by M. Kunc, A. Okhotin TALE 2007, Turku
(Finland), 2 July 2007, pages 14-32. Turku Centre for Computer Science, 2007