Analysis and applications of the XDI model

It is not always straightforward to implement a network that is robust enough to be functionally independent of communication delay. In order to specify and verify so called Delay Insensitive networks, numerous models and formalisms have been developed. In this paper we analyze one of the most expressive models. We show how based on rewrite rules we can compute, rather than invent parts of a network. We implemented these computations in a tool. We also show how healthiness, finite execution models and a distributive parallel composition cannot coexist.

[1]  Edsger W. Dijkstra,et al.  Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[2]  Willem C. Mallon,et al.  Building finite automata from DI specifications , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[3]  T. Verhoeff Factorization in Process Domains , 1998 .

[4]  T Tom Verhoeff,et al.  A theory of delay-insensitive systems , 1994 .

[5]  Radu Negulescu,et al.  Process spaces and formal verification of asynchronous circuits , 1998 .

[6]  Tom Verhoeff,et al.  Analyzing specifications for delay-insensitive circuits , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[7]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[8]  van Ch Kees Berkel Handshake circuits : an intermediary between communicating processes and VLSI , 1992 .

[9]  Ivan E. Sutherland,et al.  The counterflow pipeline processor architecture , 1994, IEEE Design & Test of Computers.