Structural methods for the synthesis of speed-independent circuits

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

Volumn 17, Issue 11, 1998, Pages 1108-1129

  Pastor, Enric ^a,b   Cortadella, Jordi ^a,b   Kondratyev, Alex ^a,b   Roig, Oriol ^a,b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

Asynchronous circuits; Petri nets; Speedindependent synthesis

Indexed keywords

COMPUTATIONAL METHODS; ELECTRIC NETWORK SYNTHESIS; FORMAL LOGIC; PETRI NETS; SIGNAL ENCODING; STATE SPACE METHODS;

ASYNCHRONOUS CIRCUITS; FREE-CHOICE SIGNAL TRANSITION GRAPHS (STG); SPEED-INDEPENDENT CIRCUITS;

DIGITAL INTEGRATED CIRCUITS;

EID: 0032202597     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.736185     Document Type: Article

References (37)

1. A. J. Martin, "Formal program transformations for VLSI circuit synthesis," in Formal Development of Programs and Proofs, E. W. Dijkstra, Ed. Reading, MA: Addison-Wesley, 1989, pp. 59-80.
2. C. A. Petri, "Kommunikation mit Automaten," Ph.D. dissertation, Institut für Instrumentelle Mathematik, Bonn, 1962, Tech. Rep. Schriften des UM Nr. 3.
3. M. A. Kishinevsky, A. Y. Kondratyev, and A. R. Taubin, "Formal method for self-timed design," in Proc. Eur. Design Automation Conf., Feb. 1991, pp. 197-201.
4. L. Y. Rosenblum and A. V. Yakovlev, "Signal graphs: From self-timed to timed ones," in Proc. Int. Workshop Timed Petri Nets, July 1985, pp. 199-206.
5. T.-A. Chu, "Synthesis of self-timed VLSI circuits from graph-theoretic specifications," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, June 1987.
6. E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. SangiovanniVincentelli, "SIS: A system for sequential circuits synthesis," University of California, Berkeley/ERL, Tech. Rep. M92/41, May 1992.
7. P. A. Beerel and T. H. Meng, "Automatic gate-level synthesis of speedindependent circuits," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, IEEE Computer Society Press, Nov. 1992, pp. 581-586.
8. C. Ykman-Couvreur, B. Lin, and H. De Man, "ASSASSIN: A synthesis system for asynchronous control circuits," IMEC, Sept. 1994, Tech. Rep., user and tutorial manual.
9. K.-J. Lin and C.-S. Lin, "Automatic synthesis of asynchronous circuits," in Proc. ACM/IEEE Design Automation Conf., IEEE Computer Society Press, June 1991, pp. 296-301.
10. C. Ykman-Couvreur, B. Lin, G. Goossens, and H. De Man, "Synthesis and optimization of asynchronous controllers based on extended lock graph theory," in Proc. Eur. Conf. Design Automation (EDAC), Feb. 1993, pp. 512-517.
11. M. Hack, "Analysis of production schemata by Petri nets," M.S. thesis, Massachusetts Institute of Technology, Cambridge, Feb. 1972.
12. J. Desel and J. Esparza, Free Choice Petri Nets. Cambridge, U.K.: Cambridge Univ. Press, 1995.
13. F. Garcia-Vallès and J. M. Colom, "A Boolean approach to the state machine decomposition of Petri nets with OBDD's," in Proc. 1995 IEEE Int. Conf. Systems, Man and Cybernetics, Oct. 1995.
14. P. Vanbekbergen, "Optimized synthesis of asynchronous control circuits from graph-theoretic specification," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, Nov. 1990, pp. 184-187.
15. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. SangiovanniVincentelli, Logic Minimization Algorithms for VLSI Synthesis. Norwell, MA: Kluwer Academic, 1984.
16. F. M. Brown, Boolean Reasoning: The Logic of Boolean Equations. Norwell, MA: Kluwer Academic, 1990.
17. V. I. Varshavsky, Self-Timed Control of Concurrent Processes. Norwell, MA: Kluwer Academic, 1990.
18. K. Lautenbach, "Linear algebraic techniques for place/transition nets," in Petri Nets: Central Models and their Properties, Advances in Petri Nets 1986, W. Brauer, W. Reisig, and G. Rozenberg, Eds., vol. 254 of Lecture Notes in Computer Science. Berlin, Germany: Springer Verlag, 1987, pp. 142-167.
19. A. Kondratyev, M. Kishinevsky, B. Lin, P. Vanbekbergen, and A. Yakovlev, "Basic gate implementation of speed-independent circuits," in Proc. ACM/IEEE Design Automation Conf., June 1994, pp. 56-62.
20. M. Kishinevsky, A. Kondratyev, A. Taubin, and V. Varshavsky, "Concurrent hardware. The theory and practice of self-timed design," Series in Parallel Computing. New York: Wiley, 1994.
21. L. Lavagno and A. Sangiovanni-Vincentelli, Algorithms for Synthesis and Testing of Asynchronous Circuits. Norwell, MA: Kluwer Academic, 1993.
22. A. Yakovlev, L. Lavagno, and A. Sangiovanni-Vincentelli, "A unified signal transition graph model for asynchronous control circuit synthesis," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, IEEE Computer Society Press, Nov. 1992, pp. 104-111.
23. T. H.-Y. Meng, R. W. Brodersen, and D. G. Messerschmitt, "Automatic synthesis of asynchronous circuits from high-level specifications," IEEE Trans. Computer-Aided Design, vol. 8, pp. 1185-1205, Nov. 1989.
24. P. A. Beerel, "CAD tools for the synthesis, verification, and testability of robust asynchronous circuits," Ph.D. dissertation, Stanford University, Stanford, CA, Aug. 1994.
25. S. Burns, "General conditions for the decomposition of state holding elements," in Proc. Int. Symp. Advanced Research in Asynchronous Circuits and Systems, Aizu, Japan, Mar. 1996, pp. 48-57.
26. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, E. Pastor, and A. Yakovlev, "Decomposition and technology mapping of speedindependent circuits using Boolean relations," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, Nov. 1997, pp. 220-227.
27. E. Pastor and J. Cortadella, "Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, Santa Clara, USA, IEEE Computer Society Press, Nov. 1993, pp. 250-254.
28. E. Pastor, J. Cortadella, A. Kondratyev, and O. Roig, "Structural methods for the synthesis of speed-independent circuits," in Proc. Eur. Design Test Conf. (EDAC-ETC.-EuroASIC), Paris, France, Mar. 1996, pp. 340-347.
29. A. Kovalyov and J. Esparza, "A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs," in Proc. Int. Workshop Discrete Event Systems, WODES'96, Aug. 1996, pp. 1-6.
30. E. Pastor and J. Cortadella, "An efficient unique state coding algorithm for signal transition graphs," in Proc. IEEE Int. Conf. Computer Design, Cambridge, MA, Oct. 1993, pp. 174-177.
31. J. Esparza and M. Suva, "A polynomial-time algorithm to decide liveness of bounded free choice nets," Theoretical Comput. Sci., no. 102, pp. 185-205, Apr. 1992.
32. O. Roig, J. Cortadella, and E. Pastor, "Verification of asynchronous circuits by BDD-based model checking of Petri nets," in Proc. 16th Int. Conf. Application and Theory of Petri Nets, Torino, June 1995, vol. 935 of Lecture Notes in Computer Science, Springer Verlag, pp. 374-391.
33. F. Mailhot and G. De Micheli, "Technology mapping using Boolean matching," in Proc. Eur. Conf. Design Automation (EDAC), Glasgow, U.K., Mar. 1990, pp. 180-185.
34. E. Pastor, J. Cortadella, and O. Roig, "A new look at the conditions for the synthesis of speed-independent circuits," in Proc. 5th Great Lakes Symp. VLSI, Buffalo, NY, May 1995, pp. 230-235.
35. A. Kondratyev, M. Kishinevsky, and A. Yakovlev, "On hazard-free implementation of speed-independent circuits," in Proc. ASP-DAC'95, Aug. 1995, pp. 241-248.
36. P. A. Beerel and T. H.-Y. Meng, "Logic transformations and observability don't cares in speed-independent circuits," in ACM Int. Workshop Timing Issues in the Specification and Synthesis of Digital Systems, Sept. 1993.
37. P. Siegel and G. De Micheli, "Decomposition methods for library binding of speed-independent asynchronous designs," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, 1994.