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

59. M. Heymann, F. Lin, Discrete-event control of nondeterministic systems. IEEE Trans.
Automat. Control 43 (1), 3-17 (1998)
60. R.M. Hierons, Using candidates to test a deterministic implementation against a non-
deterministic finite state machine. Comput. J. 46 (3), 307-318 (2003)
61. L.E. Holloway, B.H. Grogh, A. Giua, A survey of Petri net methods for controlled discrete
event systems. Discrete Event Dyn. Syst. Theory Appl. 7 (2), 151-190 (1997)
62. J.E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton. in Theory of
Machines and Computations , eds. by Z. Kohavi, A. Paz. (Academic, New York, 1971), pp.
189-196
63. J.E. Hopcroft, R. Motwani, J.D. Ullman, Introduction to Automata Theory, Languages, and
Computation . (Addison-Wesley Publishing Company, Readings, MA, 2001)
64. R.M. Jensen, DES controller synthesis and fault tolerant control. Technical Report TR-2003-
40, The IT University of Copenaghen, Dec 2003
65. T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli, Implicit computation of compatible
sets for state minimization of ISFSMs. IEEE Trans. Comput. Aided Des. 16 (7), 657-676
(1997)
66. T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli, Synthesis of FSMs: functional
optimization . (Kluwer, Boston, 1997)
67. T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli, Theory and algorithms for state
minimization of nondeterministic FSMs. IEEE Trans. Comput. Aided Des. 16 (11), 1311-
1322 (1997)
68. S. Khatri, A. Narayan, S. Krishnan, K. McMillan, R. Brayton, A. Sangiovanni-Vincentelli,
Engineering change in a non-deterministic FSM setting. in The Proceedings of the Design
Automation Conference , pp. 451-456, June 1996
69. J. Kim, M.M. Newborn, The simplification of sequential machines with input restrictions.
IRE Trans. Electron. Comput. 1440-1443 (1972)
70. N. Klarlund, Mona & Fido: The logic-automaton connection in practice. in Computer science
logic : 11th international workshop, CSL '97 , eds. by M. Nielsen, W. Thomas. volume 1414
of LNCS . (Springer, Berlin, 1998), pp. 311-26
71. N. Klarlund, A. Moller, MONA version 1.3 user manual. Note Series NS-98-3, BRICS, Oct
1998
72. Z. Kohavi, Switching and Finite Automata Theory , 2nd edn. (McGraw-Hill Book Company,
New York, 1978)
73. D.C. Kozen, Theory of Computation . (Springer, Berlin, 2006)
74. S.C. Krishnan, ! -Automata, Games and Synthesis . PhD thesis, EECS Department, University
of California, Berkeley, 1998. Tech. Report No. UCB/ERL M98/30
75. Y. Kukimoto, the VIS Group, BLIF-MV. Website at http://vlsi.colorado.edu/ vis/usrDoc.
html and http://embedded.eecs.berkeley.edu/ vis/usrDoc.html
76. R. Kumar, V. Garg, S.I. Marcus, On controllability and normality of discrete event dynamical
systems. Syst. Control Lett. 17 (3), 157-168 (1991)
77. R. Kumar, V.K. Garg, Modeling and Control of Logical Discrete Event Systems .(Kluwer,
Dordrecht, 1995)
78. R. Kumar, S. Nelvagal, S.I. Marcus, A discrete event systems approach for protocol
conversion. Discrete Event Dyn. Syst. Theory Appl. 7 (3), 295-315 (1997)
79. R. Kumar, M.A. Shayman, Non-blocking supervisory control of nondeteministic sysmtes via
prippritized synchronization. IEEE Trans. Automat. Control 41 (8), 1160-1175 (1996)
80. O. Kupferman, M.Y. Vardi, On bounded specifications. in LPAR '01: Proceedings of the
Artificial Intelligence on Logic for Programming , London, UK. (Springer, New Yo, 2001),
pp. 24-38
81. R.P. Kurshan, Complementing deterministic B uchi automata in polynomial time. J. Comput.
Syst. Sci. 35 (1), 59-71 (1987)
82. R.P. Kurshan, Computer-Aided Verification of Coordinating Processes . (Princeton University
Press, Princeton, 1994)