An overview of D-I algebra
暂无分享,去创建一个
[1] Ad M. G. Peeters,et al. Modulo-N Counters: Design and Analysis of Delay-Insensitive Circuits , 1992, Designing Correct Circuits.
[2] Matthew Hennessy,et al. Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.
[3] Mark B. Josephs,et al. The Design of a Delay-Insensitive Stack , 1991 .
[4] Rudolf H. Mak,et al. High-Level Design of an Asynchronous Packet-Routing Chip , 1992, Designing Correct Circuits.
[5] J. C. Ebergen. Translating programs into delay-insensitive circuits , 1989 .
[6] Mark B. Josephs,et al. Normal Form in a Delay-Insensitive Algebra , 1993, Asynchronous Design Methodologies.
[7] Alain J. Martin. Programming in VLSI: from communicating processes to delay-insensitive circuits , 1991 .
[8] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[9] Wei Chen,et al. Networks of Communicating Processes and Their (De-)Composition , 1989, MPC.
[10] C. A. R. Hoare,et al. The Laws of Occam Programming , 1988, Theor. Comput. Sci..
[11] Mark B. Josephs,et al. An Algebra for Delay-Insensitive Circuits , 1990, CAV.
[12] A. W. Roscoe,et al. An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.