Analysis and synthesis of concurrent digital circuits using control-flow expressions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 8, 1996, Pages 854-876

  Coelho Jr , Claudionor Nunes ^a   De Micheli, Giovanni ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER AIDED DESIGN; COMPUTER AIDED LOGIC DESIGN; COMPUTER SIMULATION; CONCURRENT ENGINEERING; CONSTRAINT THEORY; CONTROL SYSTEM SYNTHESIS; FINITE AUTOMATA; FUNCTIONS; SPECIFICATIONS; STATE SPACE METHODS; SYNCHRONIZATION;

CONCURRENT DIGITAL CIRCUITS; CONTROL FLOW EXPRESSIONS; FINITE STATE REPRESENTATION; FLEXIBLE OBJECTIVE FUNCTIONS; OPTIMAL CONTROL UNIT; SYSTEM LEVEL SPECIFICATIONS;

DIGITAL INTEGRATED CIRCUITS;

EID: 0030212079     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.511567     Document Type: Article

References (48)

1. G. De Micheli. Synthesis and Optimization of Digital Circuits. New York: McGraw Hill, 1994.
2. G. Bercy aiid G. Gonthier. The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Paris, France: Ecole Nationale Supérieure des Mines de Paris and Institut National de Recherche en Informatique et Automatique, 1988.
3. Y.-H. Hung and A. C. Parker, High-level synthesis with pin constraints for multiple-chip designs,in Proc. Design Automation Conf., June 1992, pp. 231-234.
4. D. Filo, D. C. Ku, C. N. Coelho Jr.. and G. De Micheli, Interface optimization for concurrent systems under timing constraints,IEEE Trans. VLSI Syst., vol. 1, pp. 268-281, Sept. 1993.
5. PCI Local Bus Specification Revision 2.1, 1995.
6. G. Borriello and R. Katz, Synthesis and optimization of interface transducer logic,in Proc. hit. Cunf. Computer-Atded Design, Santa Clara, CA, Nov. 1987, pp. 56-60.
7. G. Borriello, A new interface spécification methodology and its application to transducer synthesis, Univ. California, Berkeley, CA, L'CB/CSD Tech. Rep. (dissertation) 88/4301988, 1988.
8. D. Ku and G. De Micheli, High-level Synthesis ofASlC's Under Timing and Svnchronization Constraints. Norwell, MA: Kluwer Academic, 1992.
9. S. Narayan and D. Gajski, Interfacing incompatible protocols using interface process generation,in Proc. Design Automation Conf., June 1995, pp. 468-473.
10. i. Nestor and D. Thomas, Behavioral synthesis with interfaces,in Proc. Design Automation Conf., June 1986, pp. 112-115.
11. R. K. Gupta, C. N. Coelho Jr., and O. De Micheli, Synthesis and simulation of digital systems containing interacting hardware and software components,in Proc. 29th Design Automation Conf., June 1992, pp 225-230.
12. Program implementation schemes for hardware-software systems,IEEE Trans. Comput., vol. 43, pp. 48-55, Jan. 1994.
13. A. Wu, D. Gajski, N. Dutt, and S. Lin, High-Level VLSI Synthesis-Introduction to Chip and System Design. Norwell, MA: Kluwer Academic. 1992.
14. Z. Zhu and S. D. Johnson, An example of interactive hardware transformation, Indiana Univ., Tech. Rep. 383, 1993.
15. D. E. Thomas and P. R. Moorby, The Verilog Hardware Description Language. Norwell, MA: Kluwer Academic, 1991.
16. F. Bbussinot and R. De Simone, The ESTEREL language,Proc. IEEE, vol. 79, pp. 1293-1303, Sept. 1991.
17. J. C. M. Baeten, Process Algebra. New York: Cambridge Univ. Press. 1990.
18. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Compulation. Reading, MA: Addison Wesley, 1979.
19. J. I.aski, Path expressions in data flow program testing.in Proc. 14th Ann. Int. Comput. Software Appl. Conf, Chicago, IL, 1990, pp. 570-576.
20. M. R. Paige, On partitioning program graphs,IEEE Trans. Software Eng., vol. SE-3, pp. 386-393, Nov. 1977.
21. R. Milner, A complete inference system for a class of regular behaviors, 3. Comput. Syst. Sei., vol. 28, pp. 439-467, 1984.
22. Y. Choueka, Theories of automata on i'-tapes: A simplified approach, J. Comput. Syst. Sei., vol. 8, pp. 117-141, 1974.
23. R. H. Campbell, Path expressions: A technique for specifying process synchronization, Ph.D. dissertation, Dept. Comput. Sei., Univ. Illinois, Urbana, IL, UIUCDCS-R-77-863, Aug. 1976.
24. D. Drusinsky and D. Harel, Statecharts as an abstract model for digital control-units, Weizmann Inst. Sei., Tech. Rep. CS86-12, 1986.
25. R. Saracco, Telecommunications Systems Engineering Using SDL. New York: Eisevier Sei., 1989.
26. J. L. Peterson. Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
27. T. H. Wang, Repeatable firing sequences for pctri nets under conventional, subset and timed firing rules, Ph.D. dissertation, Case Western Reserve Univ., Cleveland, OH, 1988.
28. R. Milner, Handbook of theoretical computer science,Operational and Alhehraic Semantics of Concurrent Processes Cambridge, MA: Mass. Inst. Technol. Press, 1991, vol. 2, ch. 19. pp. 1201 1242.
29. Z. Zhu and S. D. Johnson, Automatic synthesis of sequential synchronization,in Proc, 1FIP Conf. Hardware Descripl. Lung. Appl, Ottawa, Canada, Apr. 1993.
30. Capturing synchronization specifications for sequential compositions,in Proc. Int. Conf. Comput. Design, Oct. 1994, pp. 117-121.
31. W. Wolf, A. Takach, and T. Lee, High-Level VLSI Synthesis,Architectural Optimization Methods for Control-Dominated Machines. Norwell, MA: Kluwer Academic, 1991.
32. C.-T. Hwang, J.-H. Lee, and Y-C Hsu, A formal approach to the scheduling problem in high-level synthesis, IEEE Trans. ComputerAided Design, vol. 10, pp. 464-475, Apr. 1991.
33. A. Takach, W. Wolf, and M. Leessr, An automaton model for scheduling constraints, IEEE Trans. Comput, vol. 44, pp. 1-12, Jan. 1995.
34. W. Wolf, A. Takach, C. Huang, and R. Manno, The Princeton Uni vcrsity behavioral synthesis system,in Proc. 29th Design Automation ConJ., June 1992, pp. 182-187.
35. J. A. Brzozowski, Derivatives of regular expressions, J. Assoc. Comput. Mach., vol. 11, no. 4, pp. 481-94, Oct. 1964.
36. C. H. Gebotys, Optimal VLSI Architectural Synthesis. Norweli, MA: Kluwer Academic, 1991.
37. T. Kim, J. W. S. Liu, and C. L. Liu, A scheduling algorithm for conditional resource sharing,in Proc. Int. Conf. Compuler-Aided Design, Santa Clara, CA, Nov. 1991, pp. 84-87.
38. I. Radivojevic and F. Brewer, Symbolic techniques for optimal scheduling,in Proc. Synth. Simul. Meeting Int. Interchange-SASIMI, Nara, Japan, Oct. 1993, pp. 145-154.
39. L. Hafer and A. Parker, Automated synthesis of digital hardware,IEEE Trans. Comput., C-31, pp. 93-109. Feb. 1982.
40. P. Marwedel, Matching system and component behavior in mimola synthesis tool,in Proc. Euro. Design Automation Conf., Mar. 1990, pp. 146-156.
41. K. Wakabayashi and H. Tanaka, Global scheduling independent of control dependencies based on condition vectors.in Proc. Design Automation Conf., June 1992, pp. 112-115.
42. D. LanneerrfaJ., Architectural synthesis for medium and high throughput signal processing with the new cathedral environment,'' in R. Camposano and W. Wolf, Eds., High-level {VLSI} Synthesis. Norweli, MA: Kluwer Academic, June 1991, pp. 27-54.
43. S. Note, G. Goossens, F. Catthoor, and H. De Man, Combined hardware selection and pipelining in high-performance data-path design,IEEE Trans. Computer-Aided. Design, vol. 11, pp. 413-423, Apr. 1992.
44. L. Gtierra, M. Potkonjak, and J. Rabaey, High level synthesis for reconfigurable datapath structures,in Proc. Int. Conf. Computer-Aided Design, Nov. 1993, pp. 26-29.
45. R. E. Bryant, Graph-based algorithms for Boolean function manipulation,IEEE Trans. Comput., vol. C-35, pp. 677-691, Aug. 1986.
46. S.-W. Jeong and F. Somenzi, Logic synthesis and optimization,A New Algorithm for 0-1 Programming Based on Binary Decision Diagrams. Norweli, MA: Kluwer Academic, 1993, ch. 2, pp. 145-166.
47. J.-K. Rho, G. D. Hachtel, F. Somenzi, and R. M. Jacoby, Exact and heuristic algorithms for tlie minimization of incompletely specified state machines,IEEE Trans. Computer-Aided Design, vol. 13. pp. 167-177, Feb. 1994.
48. C. N. Coelho Jr., Analysis and synthesis of concurrent digital circuits using control flow expressions, Ph.D. dissertation, Stanford Univ., Stanford, CA, 1995.