Bibliogra�a

[1] Keumog Ahn and Sartaj Sahni. Constrained via minimization. IEEETransactions on Computer-Aided Design, 12(2):273{282, February 1993.

[2] S. B. Akers Jr. Binary decision diagrams. IEEE Transactions on Com-puters, C-27(6):509{516, June 1978.

[3] Advanced risc Machines Limited (ARM). Debugging embedded sys-tems. White paper. Available at http://www.arm.com/ Documentation/WhitePapers/DebugEmbSys/index.html, 1996.

[4] D. B. Armstrong. A programmed algorithm for assigning internal codesto sequential machines. IRE Transactions on Electronic Computers, EC-11:466{472, August 1962.

[5] D. B. Armstrong, A. D. Friedman, and P. R. Menon. Design of asynch-ronous circuits assuming unbounded gate delays. IEEE Transactions onComputers, C-18(12):1110{1120, December 1969.

[6] P. Ashar, S. Devadas, and A. R. Newton. Optimum and heuristic al-gorithms for a problem of �nite state machine decomposition. IEEETransactions on Computer-Aided Design, 10(3):296{310, March 1991.

[7] P. Ashar, S. Devadas, and A. R. Newton. Sequential Logic Synthesis.The Kluwer International Series in Engineering and Computer Science.Kluwer Academic Publishers, Norwell, MA, 1992.

[8] ASPEC Technology Inc (ASPEC). A dsp processor as a portable hard co-re. White paper. Available at http://www.aspec.com/edat 97.htm, 1997.

[9] ASPEC Technology Inc (ASPEC). Hard core processors gi-ve time-to-market advantage. White paper. Available athttp://www.aspec.com/vchip0797.htm, 1997.

[10] ASPEC Technology Inc (ASPEC). Process-portable ip co-res enable system-on-a-chip design. White paper. Available athttp://www.aspec.com/vchip0997.htm, 1997.

291

292 Bibliogra�a

[11] M. J. Avedillo. Una aproximaci�on al dise~no �optimo de m�aquinas deestados �nitos. PhD thesis, Universidad de Sevilla, Facultad de F��sica,Sevilla, Spain, 1992. (In Spanish).

[12] M. J. Avedillo, J. M. Quintana, and J. L. Huertas. State reduction ofincompletely speci�ed �nite sequential machines. In Proceedings of theIFIP Working Conference on Logic and Architecture Synthesis, pages107{115, Paris, May-Jun 1990. International Federation for InformationProcessing.

[13] M. J. Avedillo, J. M. Quintana, and J. L. Huertas. smas: a program forconcurrent state reduction and state assignment of �nite state machines.In Proceedings of the IEEE International Symposium on Circuits andSystems - ISCAS, pages 1781{1784, Singapore, June 1991. The Instituteof Electrical and Electronics Engineers.

[14] A. Aziz, F. Balarin, S.-T. Cheng, R. Hojati, S. C. Krishnan, R. K. Ran-jan, T. R. Shiple, V. Singhal, H.-Y. Wang, R. K. Brayton, and A. L.Sangiovanni-Vincentelli. HSIS: a BDD-based environment for formal ve-ri�cation. In Proceedings of the ACM/IEEE Design Automation Confe-rence - DAC, San Diego, CA, June 1994. The Institute of Electrical andElectronics Engineers.

[15] J. Babb, R. Tessier, M. Dahl, S. Z. Hanono, D. M. Hoki, and A. Agarwal.Logic emulation with virtual wires. IEEE Transactions on Computer-Aided Design, 16(6):609{626, June 1997.

[16] F. Balarin, M. Chiodo, P. Giusto, H Hsieh, A. Jurecska, L. Lavagno,A. Passerone, A. Sangiovanni-Vincentelli, K. Sentovich, E. M. Suzuki,and B. Tabbara. Hardware-Software Codesign of Embedded Systems: thepolis Approach. Kluwer Academic Publishers, June 1997.

[17] T. J. Barnes, D. Harrison, A. R. Newton, and R. L. Spickelmeier. Elec-tronic cad Frameworks. Kluwer Academic Publishers, 1992.

[18] E. S. Barros. Hardware/software partitioning using UNITY. PhD thesis,Eberhard-Karls-Universit�at, Fakult�at f�ur Informatik, T�ubingen, Germa-ny, 1993.

[19] G. Biehl. Overview of complex array-based plds. In G. Goos and J. Hart-manis, editors, Second International Workshop on Field-ProgrammableLogic and Applications, pages 1{10, Vienna, Austria, August-September1992. Springer Verlag. Published in Lecture Notes in Computer Science,LNCS 705, 1993.

Bibliogra�a 293

[20] G. Bostock. FPGAs and Programmable lsi: a designer's handbook.Butterworth-Heinemann, Oxford, UK, 1996.

[21] K. S. Brace, R. L. Rudell, and R. E. Bryant. E�cient implementationof a bdd package. In Proceedings of the ACM/IEEE Design AutomationConference - DAC, 1990.

[22] R. K. Brayton, J. D. Cohen, G. D. Hachtel, B. M. Tragger, and D. Y. Y.Yun. Fast recursive Boolean function manipulation. In Proceedings ofthe IEEE International Symposium on Circuits and Systems - ISCAS,pages 58{62, Rome, May 1982. The Institute of Electrical and ElectronicsEngineers.

[23] R. K. Brayton, G. D. Hachtel, C. McMullen, and A. L. M. Sangiovanni-Vincentelli. Logic Minimization Algorithms for vlsi Synthesis. KluwerAcademic, Hingham, MA, 1984.

[24] R. K. Brayton, G. D. Hachtel, A. L. Sangiovanni-Vincentelli, F. Somen-zi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Par-do, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, andT. Villa. VIS: a system for veri�cation and synthesis. Technical ReportUCB/ERL M95, University of California, Berkeley, CA, December 1995.

[25] R. K. Brayton, G. D. Hachtel, and A. L. M. Sangiovanni-Vincentelli. Mul-tilevel logic synthesis. Proceedings of the IEEE, 78(2):264{300, February1990.

[26] R. K. Brayton, R. Rudell, A. L. M. Sangiovanni-Vincentelli, and A. Wang.MIS: A multiple level logic optimization system. IEEE Transactions onComputer-Aided Design, CAD-6(6):1062{1081, November 1987.

[27] R. K. Brayton and F. Somenzi. Boolean relations. In Proceedings of theInternational Workshop on Logic Synthesis, Research Triangle Park, NC,May 1989. 9 pages.

[28] F. M. Brown. Boolean Reasoning: the logic of Boolean equations. KluwerAcademic Publishers, Norwell, MA, 1990.

[29] S. Brown and J. Rose. fpga and cpld architectures: a tutorial. IEEEDesign and Test of Computers, pages 42{57, Summer 1996.

[30] S. D. Brown, R. J. Francis, J. Rose, and Z. G. Vranesic. Field-Programmable Gate Arrays. The Kluwer International Series in Engi-neering and Computer Science. Kluwer Academic Publishers, Norwell,MA, 1992.

294 Bibliogra�a

[31] R. Bryant, D. Beatty, K. Brace, K. Cho, and T. She�er. cosmos: acompiled simulator for mos circuits. In Proceedings of the ACM/IEEEDesign Automation Conference - DAC, pages 9{16, Los Alamitos, CA,June 1987. The Institute of Electrical and Electronics Engineers.

[32] R. E. Bryant. A switch-level model of VLSI logic circuits. PhD thesis,Massachussets Institute of Technology, MIT, Cambridge, March 1981.

[33] R. E. Bryant. Graph-based algorithms for Boolean function manipula-tion. IEEE Transactions on Computers, C-35(8):677{691, August 1986.

[34] J. A. Brzozowski, S. Hauck, and C.-J. H. Seger. Asynchronous Circuits,chapter 15 - Design of Asynchronous Circuits. Monographs in ComputerScience. Springer Verlag, New York, NY, March 1995.

[35] J. A. Brzozowski and C.-J. H. Seger. Asynchronous Circuits. Monographsin Computer Science. Springer Verlag, New York, NY, March 1995.

[36] J. R. Burch, M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill.Symbolic model checking for sequential circuit veri�cation. IEEE Tran-sactions on Computer-Aided Design, 13(4):401{424, April 1994.

[37] D. Burger and J. R. Goodman. Billion-transistor architectures. Compu-ter, 30(9):46{48, September 1997. Guest Editor's Introduction.

[38] S. Burns. Performance analysis and optimization ofasynchronous circuits. PhD thesis, California Institu-te of Technology - Caltech, 1991. Also available athttp://www.cs.washington.edu/research/projects/lis/oetools/www/papers/burns phd.ps.

[39] N. L. V. Calazans. Cipredi: Contribui�c~ao inicial para um m�etodo deconcep�c~ao de circuitos integrados pr�e-difundidos. Master's thesis, Uni-versidade Federal do Rio Grande do Sul, CPGCC, Porto Alegre, Brazil,July 1988. (In Portuguese).

[40] N. L. V. Calazans. State minimization and state assignment of �nitestate machines: their relationship and their impact on the implemen-tation. PhD thesis, Universit�e Catholique de Louvain, Laboratoire deMicro�electronique, Louvain-la-Neuve, Belgium, 1993.

[41] N. L. V. Calazans. Boolean constrained encoding: a new formulation anda case study. In Proceedings of the IEEE International Conference onComputer-Aided Design - ICCAD, pages 702{706, San Jose, November1994.

Bibliogra�a 295

[42] N. L. V. Calazans. Considering state minimization during state assign-ment. In I Ibero American Microelectronics Conference - X Congressof the Brazilian Microelectronics Society, pages 49{58, Canela, RS, July1995.

[43] N. L. V. Calazans, R. P. Jacobi, Q. Zhang, and C. Trullemans. Improvingbdds manipulation through incremental reduction and enhanced heuris-tics. In Proceedings of the Custom Integrated Circuits Conference, pages11.3.1{11.3.5, San Diego, CA, May 1991. The Institute of Electrical andElectronics Engineers.

[44] N. L. V. Calazans and A. D. Madeira. ASSTUCE - an exploratory envi-ronment for �nite state machines. In XXIII Conferencia Latinoamericanade Inform�atica - CLEI, pages 117{126, Valpara��so, Chile, November 1997.Tome I.

[45] T. J. Chaney and C. E. Molnar. Anomalous behavior of synchronizersand arbiters. IEEE Transactions on Computers, C-22(4):421{422, April1973.

[46] T.-A. Chu. Synthesis of Self-timed vlsi Circuits from Graph-theoreticSpeci�cations. PhD thesis, Department of EECS, MIT, June 1987.

[47] M. Ciesielski and M. Davio. fsm assignment. Unpublished note, PhilipsResearch Laboratory, Belgium, Summer, 1990.

[48] M. J. Ciesielski, J.-J. Shen, and M. Davio. A uni�ed approach toinput-output encoding for fsm state assignment. In Proceedings of theACM/IEEE Design Automation Conference - DAC, pages 176{181, SanFrancisco, CA, June 1991.

[49] E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletonsfor branching time temporal logic. In Workshop on Logic of Programs,pages 24{24, Yorktown Heights, NY, May 1981. Springer-Verlag. Volume131 of Lecture Notes in Computer Science.

[50] E. M. Clarke and J. M. Wing. Formal methods: state of the art andfuture directions. Technical Report CMU-CS-96-178, School of ComputeScience, Carnegie Mellon University, Pittsburgh, PA, September 1996.Also published in Special Issue of ACM Computing Surveys. Available athttp://www.cs.cmu.edu/Reports/1996.html.

[51] O. Clarke, E. M. Grumberg and D. E. Long. Model checking and abstrac-tions. In Nineteenth Annual ACM Symposium on Principles of Program-ming Languages, New York, January 1992. Association for ComputingMachinery.

296 Bibliogra�a

[52] D. I. A. Cohen. Introduction to Computer Theory. John Wiley & Sons,New York, 1990.

[53] EDIF Steering Committee. Electronic design interchange format. Elec-tronic Industries Association, 1987. Reference Manual, Version 2.0.0.

[54] S. Cook. The complexity of theorem proving procedures. In Third AnnualACM Symposium on Theory of Computing, pages 151{158, 1971.

[55] T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algo-rithms. The MIT Electrical Engineering and Computer Science Series.McGraw-Hill Book Company, Cambridge, MA, 1990.

[56] A. C. da R. Costa. Um guia para elabora�c~ao de m�etodos de projeto desistemas. Internal Report 003, CPGCC-UFRGS, Porto Alegre, 1982. (InPortuguese).

[57] O. Coudert and J. C. Madre. Logic synthesis and optimization, chapter2: A new graph based prime computation technique. The Kluwer Inter-national Series in Engineering and Computer Science. Kluwer AcademicPublishers, Norwell, MA, 1993. Tsutomu Sasao, Editor, pp. 33{57.

[58] O. Coudert, J. C. Madre, and H. Fraisse. A new viewpoint of two-levellogic minimization. In Proceedings of the ACM/IEEE Design AutomationConference - DAC, pages 625{630, June 1993.

[59] M. R. Dagenais. mcboole: a new procedure for exact logic minimiza-tion. IEEE Transactions on Computer-Aided Design, CAD-5(1):229{238,January 1986.

[60] M. Davio and G. Bioul. Representation of lattice functions. PhilipsReasearch Reports, 25:370{388, 1970.

[61] M. Davio, J.-P. Deschamps, and A. Thayse. Discrete and Switching Func-tions. Editions Georgi - McGraw-Hill, St-Saphorin - Switzerland, 1978.

[62] M. Davio, J.-P. Deschamps, and A. Thayse. Digital Systems with Algo-rithm Implementation. John Wiley & Sons, Chichester, 1983.

[63] G. de Micheli. Computer-aided synthesis of pla-based systems. PhDthesis, University of California, Berkeley, CA, April 1984. MemorandumNo. UCB/ERL M84/31.

[64] G. de Micheli. Symbolic design of combinational and sequential logiccircuits implemented by two-level logic macros. IEEE Transactions onComputer-Aided Design, CAD-5(4):597{616, October 1986.

Bibliogra�a 297

[65] G. de Micheli. Computer-aided hardware/software codesign. IEEE Micro,14(4):10{16, August 1994.

[66] G. de Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill Series in Electrical and Computer Engineering. McGraw-Hill, Inc.,New York, NY, 1994.

[67] G. de Micheli. Hardware/Software Codesign, chapter Hardware/softwarecodesign: application domains and design technologies. Kluwer AcademicPublishers, Dordrecht, The Netherlands, 1996. Giovanni de Micheli andMariagiovanna Sami, editors.

[68] G. de Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli. kiss: aprogram for optimal state assignment of �nite state machines. In Procee-dings of the IEEE International Conference on Computer-Aided Design -ICCAD, pages 209{211, Santa Clara, CA, November 1984. The Instituteof Electrical and Electronics Engineers.

[69] G. de Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli. Opti-mal state assignment for �nite state machines. IEEE Transactions onComputer-Aided Design, CAD-4(3):269{284, July 1985.

[70] G. de Micheli, D. Ku, F. Mailhot, and T. Truong. The olympus synthesissystem for digital design. IEEE Design & Test, pages 37{53, October1990.

[71] Andre DeHon. Role of recon�gurable computing. InStan Baker, editor, Recon�gurable Logic Roundtable Dis-cussions, Berkeley, CA, October 1996. Also available athttp://www.recon�g.com/specrept/101596/index.html.

[72] S. Devadas, H-K. T. Ma, A. R. Newton, and A. Sangiovanni-Vincentelli.A synthesis and optimization procedure for fully and easily testablesequential machines. IEEE Transactions on Computer-Aided Design,8(10):1100{1107, October 1989.

[73] S. Devadas and A. R. Newton. Exact algorithms for output encoding, sta-te assignment, and four-level Boolean minimization. IEEE Transactionson Computer-Aided Design, 10(1):13{27, January 1991.

[74] E. A. Emerson. Handbook of Theoretical Computer Science, volume B,chapter Temporal and modal logic. Elsevier Science Publishers, Amster-dam, The Netherlands, 1990. J. van Leeuwen, Editor, pp. 995{1071.

[75] A. B. de H. Ferreira and J. E. M. M. Editores Ltda. Novo Dicion�arioAur�elio da L��ngua Portuguesa. Editora Nova Fronteira, Rio de Janeiro,RJ, 1986. Segunda edi�c~ao, Vig�esima Oitava Impress~ao. (In Portuguese).

298 Bibliogra�a

[76] J. Frenkil. A multi-level approach to low-power ic design. IEEE Spec-trum, 35(2):54{60, February 1998.

[77] M. Fujita, H. Fujisawa, and N. Kawato. Evaluation and improvements ofBoolean comparison method based on binary decision diagrams. In Proce-edings of the IEEE International Conference on Computer-Aided Design- ICCAD, pages 2{5, Santa Clara, CA, November 1988. The Institute ofElectrical and Electronics Engineers.

[78] M. Fujita, Y. Matsunaga, and T. Kakuda. On variable ordering of binarydecision diagrams for the application of multi-level logic synthesis. InProceedings of the European Conference on Design Automation - EDAC,pages 25{28, Amsterdam, February 1991.

[79] S. B. Furber. armSystem Architecture. Addison Wesley Longman, 1996.

[80] S. B. Furber, J. D. Garside, S. Temple, J. Liu, P. Day, and N. C. Pa-ver. AMULET2e: an asynchronous embedded controller. In Proceedingsof the Async'97, pages 290{299. The Institute of Electrical and Electro-nics Engineers, IEEE Computer Society Press, April 1997. Available athttp://www.cs.man.ac.uk/amulet/publications/papers.html.

[81] D. D. Gajski and R. H. Kuhn. New vlsi tools. Computer, 16(12):11{14,December 1983.

[82] M. R. Garey and D. S. Johnson. Computers and Intractability: a guideto the theory of NP-completeness. W. H. Freeman and Company, SanFrancisco, CA, 1979.

[83] J. D. Garside. A cmos vlsi implementation of an asynchronousalu. In Proceedings of the IFIP Working Conference on Asynchro-nous Design Methodologies, Manchester, England, 1993. Available athttp://www.cs.man.ac.uk/amulet/publications/papers.html.

[84] L. Geppert. Technology 1998, analysis & forecast - solid state. IEEESpectrum, 35(1):23{28, January 1998.

[85] A. Ghosh, S. Devadas, and A. R. Newton. Sequential Logic Testing andVeri�cation. The Kluwer International Series in Engineering and Com-puter Science. Kluwer Academic Publishers, Norwell, MA, 1992.

[86] A. Grasselli and F. Luccio. A method for minimizing the number ofinternal states in incompletely speci�ed sequential networks. IRE Tran-sactions on Electronic Computers, EC-14:350{359, June 1965.

[87] J. Greene, E. Hamdy, and S. Beal. Antifuse �led programmable gatearrays. Proceedings of the IEEE, 81(7):1042{1056, July 1993.

Bibliogra�a 299

[88] A. Gupta. Formal hardware veri�cation methods: a survey. FormalMethods in System Design, 1(2/3):151{238, October 1992.

[89] G. D. Hachtel, J.-K. Rho, F. Somenzi, and R. Jacoby. Exact and heuris-tic algorithms for the minimization of incompletely speci�ed state machi-nes. In Proceedings of the European Conference on Design Automation -EDAC, pages 184{191, Amsterdam, February 1991.

[90] G. D. Hachtel and F. Somenzi. Logic Synthesis and Veri�cation Algori-thms. Kluwer Academic Publishers, Norwell, MA, 1996.

[91] G. Hallbauer. Procedures of state reduction and assignment in one stepin synthesis of asynchronous sequential circuits. In Proceedings of the In-ternational IFAC Symposium on Discrete Systems, pages 272{282, 1974.

[92] J. Hartmanis and R. E. Stearns. Algebraic Structure Theory of SequentialMachines. Prentice-Hall International Series in Applied Mathematics.Prentice-Hall, Inc., Englewood Cli�s, NJ, 1966.

[93] S. Hauck. Asynchronous design methodologies: an overview. Pro-ceedings of the IEEE, 83(1):69{93, January 1995. Available athttp://shrimp.cs.washington.edu/pub/olympia/AsynchArt.ps.Z.

[94] J. P. Hayes. Digital simulation with multiple logic values. IEEE Tran-sactions on Computer-Aided Design, CAD-5(2):274{283, April 1986.

[95] J. P. Hayes. Introduction to Digital Logic Design. Addison-Wesley Pu-blishing Company, 1994.

[96] J. L. Hennessy and D. A. Patterson. Computer Architecture: a quanti-tative approach. Morgan Kaufmann Publishers, Inc., San Francisco, CA,second edition, 1996.

[97] J. H. Herzog. Design and Organization of Computer Structures.Franklin, Beedle & Associates, 1996. Support slides available athttp://www.ece.orst.edu/ herzog/docs.html.

[98] F. J. Hill and G. R. Peterson. Computer Aided Logical Design with Em-phasis on vlsi. John Wiley & Sons, Inc, New York, NY, Fourth edition,1993.

[99] F. J. Hill and G. R. Peterson. Computer aided logical design with em-phasis on vlsi, chapter 10 - Synthesis of clock-mode sequential circuits.John Wiley & Sons, Inc, New York, NY, fourth edition, 1993.

[100] C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall,London, UK, 1985.

300 Bibliogra�a

[101] S. J. Hong, R. G. Cain, and D. L. Ostapko. mini: A heuristic approach forlogic minimization. IBM Journal of Research and Development, 18:443{458, September 1974.

[102] J. Hopcroft. Theory of machines and computations, chapter An n lognalgorithm for minimizing states in a �nite automaton. Academic Press,New York, NY, 1971. Z. Kohavi and A. Paz, Editors.

[103] J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory,Languages, and Computation. Addison-Wesley, 1979.

[104] D. A. Hu�man. The synthesis of sequential switching circuits. Journalof the Franklin Institute, 257:161{190, March 1954. Part I.

[105] D. A. Hu�man. The synthesis of sequential switching circuits. Journalof the Franklin Institute, 257:275{303, April 1954. Part II.

[106] D. A. Hu�man. The synthesis of sequential switching circuits. Journalof the Franklin Institute, 257:161{190/275{303, March/April 1954. PartsI and II.

[107] W. S. Humphrey, Jr. Switching Circuits with Computer Applications.McGraw-Hill Book Company, Inc, York, PA, 1958.

[108] The Institute of Electrical and Electronics Engineers, New York, NY.IEEE Standard vhdl Language: Reference Manual, 1988. 150p.

[109] R. P. Jacobi. A study of the application of binary decision diagrams inmultilevel logic synthesis. PhD thesis, Universit�e Catholique de Louvain,Laboratoire de Micro�electronique, Louvain-la-Neuve, Belgium, 1993.

[110] R. P. Jacobi. S��ntese de Circuitos L�ogicos Combinacionais. D�ecimaEscola de Computa�c~ao. Sociedade Brasileira de Computa�c~ao, Campinas,July 1996.

[111] R. P. Jacobi, N. L. V. Calazans, and C. Trullemans. Incremental reduc-tion of binary decision diagrams. In Proceedings of the IEEE Interna-tional Symposium on Circuits and Systems - ISCAS, pages 3174{3177,Singapore, June 1991. volume 5.

[112] T. Kam, T. Villa, R. K. Brayton, and A. Sangiovanni-Vincentelli. Afully implicit algorithm for exact state minimization. In Proceedings ofthe ACM/IEEE Design Automation Conference - DAC, San Diego, June1994.

[113] K. Karplus. Representing boolean functions with if-then-else dags. Te-chnical Report CRL-88-28, University of California at Santa Cruz, SantaCruz, November 1988.

Bibliogra�a 301

[114] M. A. Kishinevsky, A. Y. Kondratyev, A. R. Taubin, and V. I. Varshavs-ky. On self-timed behavior veri�cation. In ACM International Workshopon Timing Issues in the Speci�cation and Synthesis of Digital Systems -TAU, 1992.

[115] Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill Com-puter Science Series. McGraw-Hill Book Company, New Delhi, secondedition, 1978.

[116] R. P. Kurshan. Computer-Aided Veri�cation of Coordinating Processes.Princeton University Press, Princeton, NJ, 1994.

[117] L. Lavagno and A. L. Sangiovanni-Vincentelli. Algorithms for Synthe-sis and Testing of Asynchronous Circuits. Kluwer Academic Series inEngineering and Computer Science. Kluwer Academic Publishers, May1993.

[118] C. Lee. Representation of switching circuits by binary-decision programs.Bell System Technical Journal, 38:985{999, July 1959.

[119] E. B. Lee and M. Perkowski. Concurrent minimization and state assign-ment of �nite state machines. In Proceedings of the 1984 InternationalConference on Systems Man and Cybernetics, pages 248{260, Halifax,October 1984.

[120] C. Leiserson, F. Rose, and J. Saxe. Optimizing synchronous circuits byretiming. In Third Caltech Conference on VLSI, pages 87{116. ComputerScience, 1983.

[121] C. Leiserson and J. Saxe. Optimizing synchronous circuits. Journal ofVLSI Computer Systems, 1(1):41{67, Spring 1983.

[122] B. Lin and A. R. Newton. A generalized approach to the constrained cu-bical embedding problem. In Proceedings of the International Conferenceon Computer Design: VLSI in Computers and Processors - ICCD, pages400{403. The Institute of Electrical and Electronics Engineers, October1989.

[123] B. Lin and F. Somenzi. Minimization of symbolic relations. In Procee-dings of the IEEE International Conference on Computer-Aided Design- ICCAD, pages 88{91, Santa Clara, CA, November 1991. The Instituteof Electrical and Electronics Engineers.

[124] R. Lipsett, C. Schaefer, and C. Ussery. vhdl: Hardware Description andDesign. Kluwer Academic Publishers, Boston, MA, 1989.

302 Bibliogra�a

[125] C. N. Liu. A state variable assignment method for asynchronous se-quential switching circuits. Journal of the Association for ComputingMachinery, 10:209{216, April 1963.

[126] Sharad Malik, A. R. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli. Logic veri�cation using binary decision diagrams in a logicsynthesis environment. In Proceedings of the IEEE International Confe-rence on Computer-Aided Design - ICCAD, pages 6{9, Santa Clara, CA,November 1988. The Institute of Electrical and Electronics Engineers.

[127] M. M. Mano. Digital Design. Prentice-Hall International, London, UK,second edition, 1991.

[128] M. P. Marcus. Derivation of maximal compatibles using Boolean algebra.IBM Journal of Research and Development, 8:537{538, November 1964.

[129] A. Martin. The limitations to delay-insensitivity in asynchronous circuits.In Proceedings of the Conference on Advanced Reesrach in vlsi, April1990.

[130] A. J. Martin, S. M. Burns, T. K. Lee, D. Borkovic, and P. J. Hazewin-dus. The design of an asynchronous microprocessor. In Charles L. Seitz,editor, Advanced Research in VLSI: Proceedings of the Decennial CaltechConference on VLSI, pages 351{373. MIT Press, 1989.

[131] S. Mazor and P. Langstraat. A Guide to vhdl. Kluwer Academic Pu-blishers, Boston, MA, 1996. 310p.

[132] E. J. McCluskey. Minimization of Boolean functions. Bell LaboratoriesTechnical Journal, 35:1417{1444, November 1956.

[133] K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers,Norwell, MA, 1993.

[134] G. H. Mealy. A method for synthesizing sequential circuits. Bell SystemsTechnical Journal, 34:1045{1079, September 1955.

[135] A. J. Medland. The Computer-Based Design Process. Chapman & Hall,London, UK, Second edition, 1992.

[136] P. Michel, U. Lauther, and P. Duzy. The Synthesis Approach to Digi-tal System Design. The Kluwer International Series in Engineering andComputer Science. Kluwer Academic Publishers, Norwell, MA, 1992.

[137] R. E. Miller. Switching Theory, volume Volume II: Sequential circuitsand machines. John Wiley & Sons, 1965.

Bibliogra�a 303

[138] E. F. Moore. Gedanken experiments on sequential machines. AutomataStudies, pages 129{153, 1956.

[139] D. E. Muller andW. C. Bartky. A theory of asynchronous circuits. Annalsof Computing Laboratory of Harvard University, pages 204{243, 1959.

[140] T. Murata. Petri nets: properties, analysis and applications. Proceedingsof the IEEE, pages 541{580, April 1989.

[141] R. Murgai. Optimum functional decomposition using encoding. In Proce-edings of the ACM/IEEE Design Automation Conference - DAC, pages408{414, 1994.

[142] C. J. Myers and T. H.-Y. Meng. Synthesis of timed asynchronous cir-cuits. IEEE Transactions on Very Large Scale Integration(vlsi) Systems,1(2):106{119, June 1993. Anything else.

[143] T. Nanya. Logic synthesis and optimization, chapter 9: Challenges todependable asynchronous processor design. The Kluwer International Se-ries in Engineering and Computer Science. Kluwer Academic Publishers,Norwell, MA, 1993. Sasao, T., Editor.

[144] J. Nolt and D. Rohatyn. L�ogica. Schaum. Makron Books do BrasilEditora Ltda, Rio de janeiro, 1991. (in Portuguese).

[145] H. Nyquist. Certain topics in telegraph transmission theory. Transactionsof the AIEE, 47:617{644, 1928.

[146] J. V. Old�eld and R. C. Dorf. Field Programmable Gate Arrays: recon�-gurable logic for rapid prototyping and implementation of digital systems.John Wiley & Sons, Inc., New York, NY, 1995.

[147] C. A. Papachristou and D. Sarma. An approach to sequential circuitconstruction in lsi programmable arrays. IEE Proceedings, 130(5):159{164, September 1983.

[148] S. S. Patil and J. B. Dennis. Speed independent asynchronous circuits.In Proceedings of Hawaii International Conference on System Sciences,pages 55{58, 1971.

[149] D. A. Patterson and J. L. Hennessy. Computer Organization & Design:the hardware/software interface. Morgan Kaufmann Publishers, Inc., SanFrancisco, CA, 1994.

[150] M. C. Paull and S. H. Unger. Minimizing the number of states in in-completely speci�ed sequential switching functions. IRE Transactionson Electronic Computers, EC-8:356{367, September 1959.

304 Bibliogra�a

[151] C. P. P eeger. State reduction in incompletely speci�ed �nite-state ma-chines. IEEE Transactions on Computers, C-22(12):1099{1102, Decem-ber 1973.

[152] B. Preas and M. Lorenzetti. Physical Design Automation of vlsi Systems.Benjamin Cummings, Menlo Park, CA, 1988.

[153] M. Riordan and L. Hoddeson. Crystal Fire: the birth of the informationage. W. W. Norton, New York, NY, 1997. 352 pages.

[154] M. Riordan and L. Hoddeson. The origins of the pn junction. IEEESpectrum, 34(6):46{51, June 1997.

[155] F. Romeo and A. Sangiovanni-Vincentelli. Probabilistic hill-climbing al-gorithms: properties and applications. In Chapel Hill Conference on VeryLarge Scale Integration, 1985.

[156] F. U. Rosenberger, C. E. Molnar, T. J. Chaney, and T.-P. Fang. Q-modules: internally clocked delay-insensitive modules. IEEE Transac-tions on Computers, 37(9):1005{1018, September 1988.

[157] L. Y. Rosenblum and A. V. Yakovlev. Signal graphs: from self-timedto timed ones. In International Workshop on Timed Petri Nets, Torino,Italy, 1985.

[158] R. Rudell and A. Sangiovanni-Vincentelli. espresso-mv: algorithmsfor multiple-valued logic minimization. In Proceedings of the CustomIntegrated Circuits Conference, pages 230{234, June 1985.

[159] D. E. Rutherford. Introduction to Lattice Theory, volume 2 of UniversityMathematical Monographs. Oliver & Boyd, Edinburgh, Scotland, 1965.

[160] A. Saldanha, T. Villa, R. K. Brayton, and A. L. Sangiovanni-Vincentelli.A framework for satisfying input and output encoding constraints. InProceedings of the ACM/IEEE Design Automation Conference - DAC,pages 170{175, San Francisco, CA, June 1991.

[161] A. Sangiovanni-Vincentelli, P. C. McGeer, and A. Saldanha. Veri�cationof electronic systems. In Proceedings of the ACM/IEEE Design Automa-tion Conference - DAC, 1996. Panel: Hot New Trends in Veri�cation.

[162] R. R. Schaller. Moore's law: past, present, and future. IEEE Spectrum,34(6):52{59, June 1997.

[163] Semiconductor Industry Association, San Jose, CA. The National Tech-nology Roadmap for Semiconductors, 1994.

Bibliogra�a 305

[164] E. M. Sentovich, K. J. Singh, L. Lavagno, R. Moon, C. Murgai, A. Sal-danha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli. sis: a system for sequential circuit synthesis. Techni-cal Report UCB/ERL M92/41, Electronics Research Lab, Universi-ty of California, Berkeley, CA, May 1992. Available at http://www-cad.eecs.berkeley.edu/Respep/Research/vis/usrDoc.html.

[165] C. Shannon. A mathematical theory of communication. Bell SystemTechnical Journal, 27:279{423, 623{656, 1948.

[166] C.-J. Shi and J. A. Brzozowski. An e�cient algorithm for constrainedencoding and its applications. Technical Report CS-92-20, University ofWaterloo, Waterloo, Canada, April 1992.

[167] C.-J. Shi and J. A. Brzozowski. E�cient constrained encoding for vlsisequential logic synthesis. In Proceedings of the European Design Auto-mation Conference - EURO-DAC, pages 266{271, Hamburg, Germany,September 1992. IEEE Computer Society Press.

[168] J. Staunstrup. A Formal Approach to Hardware Design. The Kluwerinternational Series in Engineering and Computer Science. Kluwer Aca-demic Publishers, Dordrecht, The Netherlands, 1994.

[169] S. Su and P. Cheung. Computer minimization of multivalued switchingfunctions. IEEE Transactions on Computers, C-21(9):995{1003, Septem-ber 1972.

[170] CFI Architectural Technical Subcommittee. cad frameworks users, goalsand objectives. Technical report, cad Framework Initiative, December1900. Version 0.92.

[171] I. E. Sutherland. Micropipelines. Communications of the ACM,32(6):720{738, June 1989. Turing Award Lecture.

[172] A. A. Suzim. A cad frame for vlsi design. In Simp�osio Brasileiro deConcep�c~ao de Circuitos Integrados, Gramado, RS, Brazil, 1988. Socieda-de Brasileira de Computa�c~ao.

[173] E. E. Swartzlander, Jr. Computer Arithmetic. Dowden, Hutchinson &Ross, Stroudsburg, PA, 1980.

[174] E. E. Swartzlander, Jr. Computer Arithmetic, volume II. IEEE ComputerSociety Press, Los Alamitos, CA, 1990.

[175] S.-Y. Tan, W.-F. Yen, and S. B. Furber. The design ofan asynchronous vhdl synthesizer. In Proceedings of DA-TE'98, Paris, France, February 1998. Also available athttp://www.cs.man.ac.uk/amulet/publications/papers.html.

306 Bibliogra�a

[176] Olav ten Bosch. Design ow management in CAD frameworks. PhDthesis, Delft University of Technology, Delft, September 1995.

[177] Texas Instruments. The ttl Data Book, 1985. Two volumes.

[178] G. K. Theodoropoulos, G. K. Tsakogiannis, and J. V. Woods. Oc-cam: an asynchronous hardware description language? In Pro-ceedings of the 23rd IEEE Euromicro Conference on New Frontiersof Information technology, pages 249{256, Budapest, Hungary, Sep-tember 1997. IEEE Computer Society Press. Also available athttp://www.cs.man.ac.uk/amulet/publications/papers.html.

[179] D. E. Thomas and P. R. Moorby. The Verilog Hardware DescriptionLanguage. Kluwer Academic Publishers, Boston, MA, 1991. 250p.

[180] J. H. Tracey. Internal state assignment for asynchronous sequential ma-chines. IEEE Transactions on Electronic Computers, EC-15(4):551{560,August 1966.

[181] S. H. Unger. A row assignment for delay-free realizations of ow tables wi-thout essential hazards. IEEE Transactions on Computers, C-17(2):146{158, February 1968.

[182] S. H. Unger. Asynchronous Sequential Switching Circuits. Wiley-Interscience { John Wiley & Sons, New York, NY, 1969.

[183] J. L. A. van de Snepscheut. Trace Theory and vlsi Design, volume 200of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany,1985. PhD Thesis.

[184] J. van Leeuwen. Handbook of Theoretical Computer Science. ElsevierScience Publishers, Amsterdam, The Netherlands, 1990. Two volumes.

[185] P. Vanbekbergen, G. Goossens, and B. Lin. Modeling and synthesisof timed asynchronous circuits. In Proceedings of the European DesignAutomation Conference - EURO-DAC, September 1994. Also availableat http://www.imec.be/vsdm/projects/assassin/publication.html.

[186] T. Villa. Encoding problems in logic synthesis. PhD thesis, Universityof California at Berkeley, Electrical Engineering and Computer Sciences,Berkeley, USA, 1995.

[187] T. Villa and A. Sangiovanni-Vincentelli. nova: state assignment of �-nite state machines for optimal two-level logic implementation. IEEETransactions on Computer-Aided Design, 9(9):905{924, September 1990.

Bibliogra�a 307

[188] T. Villa, G. Swamy, and T. Shiple. VIS User's Manual. University ofCalifornia at Berkeley and University of Colorado at Boulder, March1997. System (Version 1.2) and documentation available at http://www-cad.eecs.berkeley.edu/Respep/Research/vis.

[189] T. Werner and V. Akella. Asynchronous processor survey. IEEE Com-puter, 30(11):67{76, November 1997.

[190] N. Weste and K. Eshraghian. Principles of cmos vlsi Design - a systemsperspective. vlsi systems series. Addison-Wesley Publishing Company,Reading, MA, 1985.

[191] Xilinx Inc (Xilinx). XC4000XV product highlights. Available athttp://www.xilinx.com/products/xc4000xv.htm, 1998.

[192] Xilinx, Inc, San Jose, CA. Xilinx Core Solutions Product Catalog, 1997.Available at http://www.xilinx.com/products/logicore/logicore.htm.

[193] A. V. Yakovlev. On limitations and extensions of stg model for desig-ning asynchronous control circuits. In Proceedings of the InternationalConference on Computer Design: VLSI in Computers and Processors -ICCD, pages 396{400, October 1992.

[194] S. Yang and M. J. Ciesielski. Optimum and suboptimum algorithms forinput encoding and its relationship to logic minimization. IEEE Tran-sactions on Computer-Aided Design, 10(1):4{12, January 1991.

[195] Saeyang Yang. Logic synthesis and optimization benchmarks. Techni-cal report, Microelectronics Center of North Carolina, Research TrianglePark, NC, January 1991. Version 3.0.

[196] C. Ykman-Couvreur, B. Lin, and H. de Man. ASSASSIN: a synthesissystem for asynchronous control circuits. IMEC vzw, Design Methodolo-gies for vlsi Systems Division, Leuven, Belgium, 1995. Also available athttp://www.imec.be/vsdm/projects/assassin/.

[197] J. Zahnd. Machines S�equentielles, volume XI of Trait�e d' �Electricit�e. Edi-tions Georgi, St-Saphorin - Switzerland, second edition, 1980. (In Fren-ch).

[198] J. Zahnd. Private letter to the author. (in French), September 1993.

�Indice

�algebra Booleana, 54�algebra de chaveamento, 39�arvore, 51

bin�aria, 51com raiz, 51folha, 51nodo, 51nodo externo, 51nodo inteno, 51nodo terminal, 51raiz, 51sub-�arvore com raiz em x, 51sub-�arvore direita, 51sub-�arvore esquerda, 51

aft

coluna, 113linha, 113MOC, 114primitiva, 116SOC, 114UOC, 114

astg

autonomo, 116entrada, 116sa��da, 116

atpg, 247fa, 100

automato-L, 251completo, 100conjunto aceita�c~ao de arestas,

251conjunto ciclo, 251determin��stico, 100

linguagem do, 101fl, 101

produto, 101uni~ao, 101

fsm, 102alfabeto de entradas, 102alfabeto de estados, 102alfabeto de sa��das, 102cobertura fechada de compat��veis,

126cobertura m��nima, 126completa, 103completamente especi�cada, 103conjunto de estados iniciais, 103conjunto fechado de compat��veis,

126estado atual, 102fun�c~ao de sa��da, 103fun�c~ao pr�oximo estado, 102implementa�c~ao combinacional,

106implementa�c~ao mista, 106implementa�c~ao seq�uencial ass��ncrona,

106implementa�c~ao seq�uencial s��ncrona,

106incompletamente especi�cada,

103m�aquina de Mealy, 103m�aquina de Moore, 103parcial, 103parte combinacional, 106sa��da, 103

309

310 �Indice Remissivo

transi�c~ao, 103fst, 99

aceita�c~ao, 100cadeia, 100completa, 100determin��stica, 100execu�c~ao, 100fortemente determin��stica, 100produto, 100run, 100

obdd, 73isomor�smo, 74

pla, 62rl, 101robdd, 74rom, 62stt

coluna, 108linha, 108

g.l.b., 52l.u.b., 52fsm

atribu��da, 144codi�cada, 144conjunto classe, 126minimiza�c~ao, 125redu�c~ao, 125satisfa�c~ao, 145simula�c~ao, 124

��n�mo, 52

abstra�c~ao existencial, 260alfabeto, 56algoritmo, 78

entrada, 78sa��da, 78

ambientemodo completamente irrestri-

to, 213modo entrada-sa��da, 214modo fundamental, 213modo fundamental normal, 214modo irrestrito, 213

modo m�ultipla mudan�ca de en-tradas, 214

modo mudan�ca �unica de entra-da, 214

modo restrito, 213modos, 213

an�alise, 237abstrata, 239concreta, 245

anticubo, 61, 62arcabou�co de pseudo-dicotomias, 175

parte global, 175parte local, 175satisfa�c~ao, 175

armazenamento de informa�c~aopermanente, 7transit�orio, 7

ASIC, 12assinalamento

por n��vel, 208por transi�c~ao, 208

associatividade, 53ass��ncrono

circuito digital, 201temporizados, 222

ass��ncronosatraso limitado, 221auto-sincronizados, 221auto-temporizados, 221independentes de velocidade, 218,

221insens��veis a atrasos, 221modelo de Hu�man, 221

atrasobin�ario, 217bounded, 216cont��nuo, 217de �o, 218de porta, 217de realimenta�c~ao, 217discreto, 217est�avel, 217

�Indice Remissivo 311

excitado, 217ilimitado, 216inteiro, 217limitado, 216real, 217tern�ario, 217unbounded, 216

atraso ideal, 216atraso inercial, 216atraso puro, 216atribui�c~ao de estado

v�alida, 150atribui�c~ao, 143

cubo, 143de entrada, 146de estado, 146, 150de sa��da, 146funcional, 144injetiva, 143

automato �nito, 100automato propriedade, 253, 257automato-L, 251

aceita�c~ao, 252aresta recorrente, 251completo, 252determin��stico, 252eleve�c~ao, 257

barreira temporal, 201bije�c~ao, 54

c�odigo, 143comprimento, 144disjuntos, 143

c�odigosintersectantes, 143

cadeia, 45circuitos integrados espec���cos para

uma dada aplica�c~ao, 12cl�ausula, 90classe de compatibilidade

condi�c~ao de fechamento, 126implica�c~ao, 126

cliquetamanho, 51

cobertura, 43binata, 58, 142classe, 43unata, 58

codi�ca�c~ao Booleana restrita, 179codi�ca�c~ao completa, 183codi�ca�c~ao de estado

v�alida, 150codi�ca�c~ao parcial, 183codi�ca�c~ao, 143, 180

1-hot, 68de Liu, 150coluna da, 144comprimento, 143, 180cubo, 143de entrada, 146de estado, 146, 150de sa��da, 146de trilha �unica, 207de trilha dupla, 208funcional, 144injetiva, 143n~ao-funcional, 144n~ao-injetiva, 143restrita completa, 153restrita parcial, 153trilha �unica, 227

cofator, 73compat��vel

exclus~ao, 127primo, 127

complemento, 54complexidade

classe NPC, 85classe NPH, 86classe NP, 85classe P, 84

comutatividade, 53Condi�c~ao de Humphrey, 149conjun�c~ao, 53

312 �Indice Remissivo

conjuntoordenado, 45parcialmente ordenado, 45totalmente ordenado, 45

conjunto independente de v�erticestamanho, 51

conjunto ordenadoelemento m�aximo, 52elemento maximal, 52elemento minimal, 52elemento m��nimo, 52limite inferior, 52limite superior m��nimo, 52

conjunto potencia, 40conjunto regular, 101conjuntos de dados alternantes, 208corre�c~ao, 26corrida, 218

cr��tica, 218corridas, 202cubo, 61

chaveamento, 61conjun�c~ao, 71conjunto satisfa�c~ao, 61constante, 62direto, 173distancia de Hamming, 71distancia entre dois, 71peso, 61, 161reverso, 173satisfa�c~ao, 189tamanho, 61vazio, 62

cubosdisjuntos, 61

diagrama de Hasse, 46n��vel, 47

dicotomia, 165digrafo, 48disjun�c~ao, 53dispositivos l�ogicos program�aveis, 12distancia de Hamming, 71

dom��nio de descri�c~ao, 21don't cares, 55

elemento atrasoest�avel, 215excitado, 215

elemento nulo, 52elemento universal, 52elementos atraso, 215emula�c~ao, 246entrada

dom��nio, 2escalabilidade, 6, 77escorregamento do rel�ogio, 202espa�cador, 208especi�ca�c~ao de fun�c~ao

equivalencia, 63mais re�nada, 63menos re�nada, 63reduzida, 63

especi�ca�c~ao tabular, 154implementa�c~ao, 154

especi�ca�c~aode fun�c~ao, 63tabular de fun�c~ao, 63

esquemacubo posicional, 157

estado, 971-distingu��veis, 132classe de compatibilidade, 125classe de compatibilidade m�axima,

125compatibilidade, 125compatibilidade condicional, 126compatibilidade incondicional,

126compatibilidade transitiva, 126compat��vel, 125compat��vel m�aximo, 125de entrada, 113equivalencia, 125est�avel, 113inst�avel, 113

�Indice Remissivo 313

interno, 113minimiza�c~ao de, 123sinal de, 10total, 113total est�avel, 113

estrutura de transi�c~ao de estados �-nita, 99

expans~ao de Shannon, 73express~ao regular, 101express~ao reticular, 60

FAconjunto de aceita�c~ao, 100estado de aceita�c~ao, 100estado �nal, 100

�nitudecondi�c~ao de, 213

�ta, 57 oresta, 51forma canonica conjuntiva, 62forma normal conjuntiva, 62FPGA, 12FST

fun�c~ao de transi�c~ao, 100fun�c~ao pr�oximo estado, 100

fun�c~ao caracter��stica, 76fun�c~ao codi�ca�c~ao, 180fun�c~ao de chaveamento, 40fun�c~ao discreta

geral, 55, 69satisfa�c~ao, 144

fun�c~aobijetora, 54bin�aria, 58binata, 58binata em xi, 58Booleana, 58completa, 54conjun�c~ao de, 60crescente, 57cubo, 61de chaveamento, 58, 155de exponencia�c~ao reticular, 60

decrescente, 57discreta, 55, 154disjun�c~ao de, 60forma normal conjuntiva, 62forma normal disjuntiva, 62geral, 155injetora, 54inteira, 57mon�otona, 57n~ao-mon�otona, 57parcial, 54representa�c~ao impl��cita, 76sobrejetora, 54unata, 58, 138unata em xi, 58

gate-arrays, 12grafo, 48

ac��clico, 50adjacencia, 48arestas, 48bipartido, 115caminho, 50caminho elementar, 50caminho simples, 50ciclo, 50clique, 51clique m�aximo, 51completo, 49componentes conexos, 50componentes fortemente cone-

xos, 50conexo, 50conjunto de arestas, 48conjunto de v�ertices, 48conjunto independente de v�ertices,

51dirigido, 48elementar, 50fortemente conexo, 50grau de v�ertice, 48grau-in de v�ertice, 48grau-out de v�ertice, 49

314 �Indice Remissivo

incidencia de, 48incidencia em, 48isomor�smo, 50la�co, 48, 50n~ao-dirigido, 48planar, 50realiza�c~ao planar, 50rotulado, 51simples, 50sub-caminho, 50subgrafos completos, 50subgrafos conexos m�aximos, 50trajeto, 50v�ertice, 48v�ertice isolado, 48

grafo de compatibilidade, 134grafo de jun�c~ao, 134grafo de transi�c~ao de estados, 108grafo de transi�c~ao de sinais, 116

hazard, 220hold, 201, 203

IBM, 264idempotencia, 53If-then-else dag, 92inclus~ao de linguagem, 242inespeci�ca�c~oes, 55inje�c~ao, 54, 206Intel, 264isomor�smo, 46, 87

l�ogica de eventos, 209la�co de realimenta�c~ao, 8lei de Moore, 77leis da absor�c~ao, 53letras, 56limite assint�otico

inferior, 79preciso, 79superior, 79

limite superior, 52limite superior m�aximo, 52

linguagem formal, 101limite, 254opera�c~ao !, 254pre�xos, 254se�c~oes, 254seq�uencia in�nita crescente, 254

linguagem regular, 101literal, 60

m�aquina de estados �nita, 102m�aquinas seq�uenciais do tipo pa-

dr~ao, 103m�etodo de prova, 241matriz avalia�c~ao, 189matriz de restri�c~oes, 188matriz dire�c~ao, 190MERGE, 209meta-estabilidade, 205meta-produto, 76micropipelines, 221min-feature size, 5, 203minimiza�c~ao simb�olica, 63mintermo, 61movimento, 189

fact��vel, 191mudan�ca

separada, 212simultanea, 212

multigrafo, 48

n~ao-especi�ca�c~oes, 55nodo

ancestral, 51ancestral pr�oprio, 51descendente, 51descendente pr�oprio, 51externo, 51�lho, 51folha, 51interno, 51irm~ao, 51pai, 51terminal, 51

�Indice Remissivo 315

n��vel de abstra�c~ao, 17, 20

OBDDredu�c~ao, 74

opera�c~ao reticular, 53opera�c~oes bin�arias, 53ordem de enumera�c~ao, 56, 59ordem parcial, 163ordem total, 74OU-EXCLUSIVO, 209

palavra, 56palavra vazia, 56parti�c~ao, 43

bloco, 43Pentium, 264personalizabilidade, 12per��odos cr��ticos, 212PLD, 12portas l�ogicas, 215problema

abstrato, 83certi�cado, 85codi�ca�c~ao, 84concreto, 84de decis~ao, 83otimiza�c~ao, 83redu�c~ao, 85

solu�c~ao em tempo polinomial,84

solu�c~ao, 84tamanho, 78tamanho da entrada, 78veri�ca�c~ao, 85

problema sm/sa dois n��veis, 184problema sm/sa dois n��veis comple-

to, 184problema sm/sa dois n��veis parcial,

184problemas

NP-completos, 85NP-duros, 86

processo, 257

processo de projeto, 16produto Booleano, 62produto Cartesiano, 40projeto

corretude, 26crit�erios de otimalidade, 27estilo de, 4fun�c~oes objetivo, 26otimalidade, 26viabilidade, 26

projeto de sistemas digitais, 4propriedade dual, 46protocolo de comunica�c~ao

duas fases, 210quatro fases, 210

prototipa�c~ao, 245prova de teorema, 242pseudo-dicotomia, 165

arcabou�co uni�cado, 170caracter��stica, 165cobertura, 166compatibilidade, 166�xa, 165 ex��vel, 165fun�c~ao satisfa�c~ao, 165lado-0, 165lado-1, 165satisfa�c~ao, 165semente, 165

race, 219rede de Petri, 115

disparo de transi�c~ao, 116lugares, 116marca, 116marca�c~ao inicial, 116marca�c~ao, 116marcada, 116rela�c~ao de uxo, 116transi�c~ao, 115

redu�c~aoalgoritmo de, 85em tempo polinomial, 85

316 �Indice Remissivo

rela�c~ao bin�ariapropriedades, 42sobre um conjunto, 44

rela�c~ao de dominancia, 161rela�c~ao de entrada, 158rela�c~ao disjuntiva, 161rela�c~ao bin�aria, 41

antissim�etrica, 44codom��nio, 42de pr�e-ordem, 44dom��nio, 42elementos, 42funcional, 42grafo, 42imagem, 42inversa de uma, 42re exiva, 44sim�etrica, 44sobre, 42sobre um conjunto, 42transitiva, 44um-para-um, 42

rela�c~ao de cobertura, 130rela�c~ao de compatibilidade, 128rela�c~ao de fechamento, 131rela�c~ao de incompatibilidade, 128rela�c~ao de incrusta�c~ao de face, 158rela�c~ao de ordem, 44

parcial, 44total, 44

rela�c~ao de transi�c~ao aumentada, 259rela�c~ao

de compatibilidade, 47de dominancia, 161de equivalencia, 47disjuntiva, 162

restri�c~ao de cobertura, 130restri�c~ao de codi�ca�c~ao

fun�c~ao satisfa�c~ao, 180satisfa�c~ao, 180

restri�c~ao de entradarelaxada, 176

restri�c~ao de entrada elementarcobertura, 178

restri�c~ao elementar, 129compatibilidade, 129incompatibilidade, 129

restri�c~aode dominancia, 161disjuntiva, 162

restri�c~oes de codi�ca�c~ao, 180restri�c~oes de fechamento elementa-

res, 131restri�c~oes injetivas, 174restri�c~oes

de entrada, 158reticulado, 52, 53

complementado, 54completo, 52distributivo, 53�nito, 52

robustez, 205

sa��dadom��nio, 2

seq�uencia, 56operador estrela, 56

seq�uencia vazia, 56setup, 201, 203simula�c~ao, 239

excita�c~oes, 239implementa�c~ao do sistema, 239modelo de, 239padr~ao de entradas, 239

sistema digital, 1, 5, 15ambiente de um, 212ass��ncrono, 16combinacional, 11, 97estado, 10estritamente seq�uencial, 11mudan�ca na entrada, 212n~ao-program�avel, 13personaliza�c~ao a cada entrada

em funcionamento, 14

�Indice Remissivo 317

personaliza�c~ao eterna ap�os a pri-meira personaliza�c~ao, 14

personaliza�c~ao eterna p�os-projeto,14

personaliza�c~ao eterna, exceto pe-lo uso de procedimentos tec-nol�ogicos especiais, 14

program�avel, 13seq�uencial, 11, 97s��ncrono, 16

sistema digital combinacional, 6sistema digital seq�uencial, 7sistemas computacionais, 263sistemas de transi�c~ao de estados �-

nitos, 98sistemas digitais

crit�erios de classi�ca�c~ao, 11�xos, 12n~ao personaliz�aveis, 12parcialmente personaliz�aveis, 13personaliz�aveis, 12personaliz�aveis p�os-fabrica�c~ao,

12personaliz�aveis por-fabrica�c~ao,

12pr�e-caracterizados, 13projeto, 4semi-dedicados, 13totalmente personaliz�aveis, 13

sobreje�c~ao, 54soma Booleana, 62standard cells, 13string, 56, 98subgrafo, 50supercubo, 61, 71supremo, 52s��mbolo, 98s��ncrono

circuito digital, 201

tabela c�ubica, 64completa, 67completamente especi�cada, 67

equivalencia, 66esquema de chaveamento, 68esquema misto, 68esquema posicional, 68esquema simb�olico, 68mais re�nada, 66menos re�nada, 66parte de entrada, 65parte de sa��da, 65redu�c~ao, 66representa�c~ao, 66satisfa�c~ao, 66

tabela de compatibilidade, 132tabela de cubos, 160tabela de uxo, 113tabela de transi�c~ao de estados, 108tarefa, 257Tektronix, 263tempo de estabelecimento, 201tempo de manuten�c~ao, 201teoria estrutural, 164teste, 246transit�orio, 219

0-hazard, 2261-hazard, 226combinacional, 226de fun�c~ao, 226de regime, 226dinamico, 226essencial, 226est�atico, 226l�ogico, 226n~ao-essencial, 226seq�uencial, 226transiente, 226

transit�orios, 202

unatilidade, 58

v�erticealcan�cabilidade de, 50conex~ao entre um par de, 50contido em caminho, 50

318 �Indice Remissivo

valida�c~ao, 237vari�aveis de estado, 212veri�ca�c~ao de equivalencia, 242veri�ca�c~ao de modelo, 242veri�ca�c~ao formal, 241veri�ca�c~ao

algoritmo de, 84vetor bin�ario, 144vetor Booleano, 144

dominancia, 160vetor codi�ca�c~ao, 189vetor distancia, 189vetor ganho, 191vetor trivalorado, 70vetor valor, 59

XOR, 209