Sequential synthesis using S1S

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

Volumn 19, Issue 10, 2000, Pages 1149-1162

  Aziz, Adnan ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL INTEGRATED CIRCUITS; FINITE AUTOMATA; INTERCONNECTION NETWORKS; OPTIMIZATION; PROBLEM SOLVING; SEQUENTIAL CIRCUITS; TREES (MATHEMATICS);

DIGITAL HARDWARE; INTERCONNECTION TOPOLOGIES; SEQUENTIAL LOGIC SYNTHESIS; TREE AUTOMATA;

COMPUTER AIDED LOGIC DESIGN;

EID: 0034295262     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.875301     Document Type: Article

References (37)

1. S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee, Software Synthesis from Dataflow Graphs. Norwell, MA: Kluwer Academic, 1996.
2. J. R. Buchi, "On a decision method in restricted second order arithmetic," in Proc. Int. Congress Logic, Methodology, and Philosophy of Science, 1960, pp. 1-11.
3. J. R. Burch, D. L. Dill, E. Wolf, and G. D. Micheli, "Modeling hierarchical combinational circuits," in Proc. Int. Conf. Computer-Aided Design, Nov. 1993, pp. 612-617.
4. Y. Choueka, "Theories of automata on omega-tapes: A simplified approach," JCSS, vol. 8, no. 2, pp. 117-141, 1974.
5. S. Devadas, "Optimizing interacting finite state machines using sequential don't cares," IEEE Trans. Computer-Aided Design, pp. 1473-1484, Dec. 1991.
6. M. DiBenedetto, A. Saldanha, and A. Sangiovanni-Vincentelli, "Model matching for finite state machines," presented at the IEEE Conf. Decision and Control, Dec. 1994.
7. C. C. Elgot, "Decision problems of finite automation design and related decision problems," Trans. Amer. Math. Soc., vol. 98, pp. 21-52, 1961.
8. Formal models and semantics (Handbook of Theoretical Computer Science), vol. B, J. van Leeuwen, Ed., Elsevier Science, Amsterdam, The Netherlands, 1990, pp. 996-1072.
9. H. Enderton, A Mathematical Introduction to Logic. New York: Academic, 1972.
10. J. Fron, J. C.-Y Yang, M. Damiani, and G. De Micheli, "A synthesis framework based on trace and automata theory," in Proc. Int. Symp. Circuits and Systems, May 1994, pp. 291-294.
11. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
12. G. D. Hachtel, J.-K. Rho, F. Somenzi, and R. Jacoby, "Exact and heuristic algorithms for the minimization of incompletely specified state machines," in Proc. Eur. Conf. Design Automation, Amsterdam, The Netherlands, Feb. 1991, pp. 184-191.
13. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley, 1979.
14. O. H. Jensen, J. T. Lang, C. Jeppesen, and K. G. Larsen, "Model construction for implicit specifications in modal logic," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1993, vol. 715.
15. T. Kam, "State minimization of finite state machines using implicit techniques," Ph D dissertation, Electron. Res. Lab., College Eng., Univ. California, Berkeley, May 1995.
16. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli, "A fully implicit algorithm for exact state minimization," in Proc. Design Automation Conf., June 1994, pp. 684-690.
17. J. Kim and M. M. Newborne, "The simplification of sequential machines with input restrictions," IRE Trans. Electron. Comput., pp. 1440-1443, Dec. 1972.
18. R. P. Kurshan, Automata-Theoretic Verification of Coordinating Processes. Princeton, NJ: Princeton Univ. Press, 1993.
19. S. Malik, "Analysis of cyclic combinational circuits," IEEE Trans. Computer-Aided Design, vol. 13, pp. 950-956, July 1994.
20. Z. Manna and J. Waldinger, "Toward automatic program synthesis," Commun. ACM, vol. 14, no. 3, pp. 151-165, Mar. 1971.
21. G. De Micheli, Synthesis and Optimization of Digital Circuits. New York: McGraw Hill, 1994.
22. J. Parrow, "Submodule construction and equation solving in CCS," Theoretical Comput. Sci., vol. 68, 1989.
23. A. Pnueli and R. Rosner, "On the synthesis of a reactive module," in Proc. ACM Symp. Principles of Programming Languages, 1989, pp. 179-190.
24. M. O. Rabin, Automata on Infinite Objects and Church's Problem. Providence, RI: Amer. Math. Soc., 1971.
25. P. Ramadge and W. Wonham, "The control of discrete event systems," Proc. IEEE, vol. 77, pp. 81-98, 1989.
26. J.-K. Rho, G. Hachtel, and F. Somenzi, "Don't care sequences and the optimization of interacting finite state machines," in Proc. Int. Conf. Computer-Aided Design, Nov. 1991, pp. 418-421.
27. S. Safra, "Complexity of Automata on Infinite Objects," Ph.D. dissetation, The Weizmann Inst. Sci., Rehovot, Israel, Mar. 1989.
28. H. Savoj, "Don't Cares in Multi-Level Network Optimization," PhD thesis, The University of California at Berkeley, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, CA, May 1992.
29. T. R. Shiple, "Formal Analysis of Synchronous Hardware," Ph.D. dissertation, Electron. Res. Lab., College Eng., Univ. California, Berkeley, CA, 1996.
30. V. Singhal, "Design Replacements for Sequential Circuits," Ph.D. dissertation, Electron. Res. Lab., College Eng., Univ. California, Berkeley, CA, 1996.
31. Formal models and semantics (Handbook of Theoretical Computer Science), vol. B, J. van Leeuwen, Ed., Elsevier Science, Amsterdam, The Netherlands, 1990, pp. 133-191.
32. R. J. van Glabbeek, "Comparative Concurrency Semantics and Refinement of Actions," PhD thesis, Centrum voor Wiskunde en Informatica, Vrije Universiteit te Amsterdam, Amsterdam, The Netherlands, May 1990.
33. H.-Y. Wang and R. K. Brayton, "Input don't care sequences in FSM networks,"in Proc. Int. Conf. Computer-Aided Design, 1993, pp. 321-328.
34. _, "Permissible observability relations in FSM networks," in Proc. Design Automation Conf., June 1994, pp. 677-683.
35. Y. Watanabe and R. K. Brayton, "The maximum set of permissible behaviors for FSM networks," in Proc. Int. Conf. Computer-Aided Design, 1993, pp. 316-320.
36. H. Wong-Toi and D. L. Dill, "Synthesizing processes and schedulers from temporal specifications," in Proc. 2nd Workshop Computer-Aided Verification, 1990, pp. 272-281.
37. W. Wonham and P. Ramadge, "On the supremal controllable language of a given language," SIAMJ. Contr. Optimization, vol. 25, pp. 637-659, 1988.