论文信息 - Analyzing Isochronic Forks with Potential Causality

Analyzing Isochronic Forks with Potential Causality

Asynchrony and concurrency are fundamental notions in the fields of asynchronous circuits as well as distributed systems. This paper treats asynchronous circuits as a special class of distributed systems. We adapt the distributed systems notion of potential causality to asynchronous circuits, and use it to provide a formal proof of the precise nature of the isochronic fork timing assumption in quasi delay-insensitive (QDI) circuits. Our proofs provide a transparent analysis that provides better intuition regarding the operation of QDI circuits. We build on our theory to rigorously establish several "folk theorems" about identifying isochronic forks in QDI circuits.

Yoram Moses | Rajit Manohar

[1] Alain J. Martin,et al. A Necessary and Sufficient Timing Assumption for Speed-Independent Circuits , 2009, 2009 15th IEEE Symposium on Asynchronous Circuits and Systems.

[2] Alain J. Martin,et al. Quasi-Delay-Insensitive Circuits are Turing-Complete , 1995 .

[3] Takashi Nanya,et al. Eliminating isochronic-fork constraints in quasi-delay-insensitive circuits , 2001, ASP-DAC '01.

[4] Alain J. Martin. Compiling communicating processes into delay-insensitive VLSI circuits , 2005, Distributed Computing.

[5] K. Mani Chandy,et al. How processes learn , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[6] Joseph Y. Halpern,et al. Knowledge and common knowledge in a distributed environment , 1984, JACM.

[7] Ronald Fagin,et al. Reasoning about knowledge , 1995 .

[8] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[9] Alain J. Martin. The limitations to delay-insensitivity in asynchronous circuits , 1990 .

[10] Kees van Berkel. Beware the isochronic fork , 1992, Integr..