Abstract
This paper considers the existence and formal specification of delay-insensitive fair arbiters. We show that the exact notion of fairness used is of critical importance because certain common notions are not delay-insensitive when used across independent interfaces. We further show that for the relevant notions of fairness, the existing trace theory of finite traces lacks the expressive power to specify a delay-insensitive fair arbiter (i.e. the specification of such a fair arbiter is also satisfied by an unfair arbiter). Based on this we extend trace theory to include infinite traces, and show by example the importance of including liveness in such a theory. The extended theory is sufficiently expressive to distinguish fair arbiters from unfair ones, and we use it to exhibit a delay-insensitive fair arbiter, thus establishing their existence. In addition our extended theory generalizes the existing trace theory by introducing a composition operator (C) that at once generalizes the existing operators and obviates the composability restrictions used by previous authors. Finally our extended theory introduces wire modules as an abstraction to capture the important role that transmission media properties play in circuit behavior.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bochman GV (1982) Hardware specification with temporal logic: An example. IEEE Trans Comput C-31 (3)
Chaney TJ, Molnar CE (1973) Anomalous behavior of synchronizer and arbiter circuits. IEEE Trans Comput C-22 (4):421–422
Dill DL, Clarke EM (1985) Automatic verification of asynchronous circuits using temporal logic. In: 1985 Chapel Hill Conference on Very Large Scale Integration, pp 127–144
Gabbay D, Pneuli A, Shelah S, Stavi J (1980) On the temporal analysis of fairness. In: Symposium on Principles of Programming Languages, pp 163–173
Lehman D, Pneuli A, Stavi J (1981) Impartiality, justice and fairness: the ethics of concurrent termination. Lect Notes Comput Sci, Automata, Languages, and Programming. Springer, Berlin Heidelberg New York, pp 265–277
Martin AJ (1985) A delay-insensitive fair arbiter. Technical Memorandum 5193:TR:85, Computer Science Department, California Institute of Technology, Pasadena, CA (July)
Martin AJ (1985) The design of a self-timed circuit for distributed mutual exclusion. In: 1985 Chapel Hill Conference on Very Large Scale Integration, pp 245–260
Milner R (1980) A calculus of communicating systems. Lecture Notes Comput Sci, vol 92. Springer, Berlin Heidelberg New York
Molnar CE, Fang TP, Rosenberger FU (1985) Synthesis of Delay-Insensitive Modules. In: 1985 Chapel Hill Conference on Very Large Scale Integration, pp 67–86
Muller DE (1967) The general synthesis problem for asynchronous digital networks. In: Conference Record of the Eight Annual Symposium on Switching and Automata Theory
Rem M et al. (1983) Trace theory and the definition of hierarchical components. In: 3rd Caltech Conference on VLSI, pp 225–239
Schols H (1985) A formalisation of the foam rubber wrapper principle. Master's thesis, Eindhoven University of Technology
Seitz CL (1980) System timing, Introduction to VLSI systems, chap 7. Addison-Wesley, Readling, Mass
Seitz CL (1980) Ideas about arbiters. LAMBDA, First Quarter
Seitz CL: Personal communication
van de Snepscheut, JLA (1985) Trace theory and VLSI design. Lect Notes Comput Sci, vol 200. Springer, Berlin Heidelberg New York Tokyo
Sproull B, Sutherland I, Molnar C (1985) Seminar on selftimed systems. Course Notes. Carnegie-Mellon University, Spring 1985 (includes some unpublished work of Jo Ebergen)
Udding JT (1984) Classification and composition of delayinsensitive circuits. PhD thesis, Eindhoven University of Technology
Udding JT (1985) On the non-existence of delay-insensitive fair arbiters. Technical Memorandum 306, Computer Systems Laboratory, Washington University, St. Louis, MO, July
Verhoeff T, Schols H (1985) Delay-insensitive directed trace structures satisfy the foam rubber wrapper postulate. Computing Science Notes 85/04, Department of Mathematics and Computing Science, Eindhoven University of Technology, August
Author information
Authors and Affiliations
Additional information
David L. Black is a graduate student and Ph.D. candidate in the Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA. His research interests include trace theory, temporal logic, and the specification, design and verification of asynchronous circuits. Mr. Black received the B.A. and M.A. degrees in Mathematics along with the B.S.E. (Computer Science and Engineering) degree in 1983 from the University of Pennsylvania, Philadelphia, PA. He also received the M.S. degree in computer science from Carnegie-Mellon University in 1985. Partial support of his graduate studies at Carnegie-Mellon has been provided by a R.K. Mellon fellowship. Mr. Black is also a member of Phi Beta Kappa, Tau Beta Pi, Eta Kappa Nu and Pi Mu Epsilon.
Rights and permissions
About this article
Cite this article
Black, D.L. On the existence of delay-insensitive fair arbiters: Trace theory and its limitations. Distrib Comput 1, 205–225 (1986). https://doi.org/10.1007/BF01660033
Issue Date:
DOI: https://doi.org/10.1007/BF01660033