Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Abridged Version
The full version of this paper appears in the ACM/AMS DIMACS series and as Technical Report WUCS-89-54, Dept. of C.S., Washington Univ., St. Louis, MO.
Download to read the full chapter text
Chapter PDF
References
S. D. Brookes and A. W. Roscoe. An Improved Failures Model for Communicating Sequential Processes. Lect. Notes in Comp. Sci. 197, 281–305, 1984.
W. Chen, J. T. Udding, and T. Verhoeff. Networks of Communicating Processes and their (De)composition. In J. L. A. van de Snepscheut, editor, The Mathematics of Program Construction, number 375 in Lecture Notes in Computer Science, 174–196. Springer-Verlag, 1989.
D. L. Dill and E. M. Clarke. Automatic Verification of Asynchronous Circuits Using Temporal Logic. In H. Fuchs, editor, 1985 Chapel Hill Conference on Very Large Scale Integration, Computer Science Press, 127–143, 1985.
D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. PhD thesis, CMU-CS-88-119, Dept. of C.S., Carnegie-Mellon Univ., 1988.
J. C. Ebergen. Translating Programs into Delay-Insensitive Circuits. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, 1987.
M. Hennessy. Algebraic Theory of Processes. Series in Foundations of Computing. The MIT Press, Cambridge, Mass., 1988.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
He Jifeng, M. B. Josephs and C. A. R. Hoare. A Theory of Synchrony and Asynchrony. In Proceedings IFIP Working Conference on Programming Concepts and Methods, (to appear), 1990.
M. B. Josephs, C. A. R. Hoare, and He Jifeng. A Theory of Asynchronous Processes. J. ACM, (submitted), 1989.
A. J. Martin. Compiling Communicating Processes into Delay-Insensitive VLSI Circuits. Distributed Computing, 1:226–234, 1986.
A. J. Martin. Programming in VLSI: From Communicating Processes to Delay-Insensitive Circuits. Caltech-CS-TR-89-1, Department of Computer Science, California Institute of Technology, 1989.
A. W. Roscoe and C. A. R. Hoare. The laws of occam programming. Theor. Comp. Sci. 60, 2:177–229, 1988.
I. E. Sutherland. Micropipelines. 1988 Turing Award Lecture. Communications of the ACM, 32(6):720–738, 1989.
J. T. Udding. Classification and Composition of Delay-Insensitive Circuits. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, 1984.
J. T. Udding. A formal model for defining and classifying delay-insensitive circuits. Distributed Computing, 1(4):197–204, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Josephs, M.B., Udding, J.T. (1991). An algebra for delay-insensitive circuits. In: Clarke, E.M., Kurshan, R.P. (eds) Computer-Aided Verification. CAV 1990. Lecture Notes in Computer Science, vol 531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023748
Download citation
DOI: https://doi.org/10.1007/BFb0023748
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54477-7
Online ISBN: 978-3-540-38394-9
eBook Packages: Springer Book Archive