% bib
%\newpage
\begin{thebibliography}{33}
{\footnotesize
\bibitem{macblane}%formerly ATT
M. R. MacBlane.
\newblock Source level atomic test-and-set for the TUXEDO system
source product.
\newblock UNIX System Laboratories, May 14, 1991.

\bibitem{TUXEDO}
{\em TUXEDO System Release 4.0 -- Product Overview}.
\newblock AT\&T, 1990.

\bibitem{BL}
J. Burns and N. Lynch.
\newblock Mutual exclusion using indivisible reads and writes.
\newblock In {\em Proceedings of 18th Annual Allerton Conference on
Communications, Control and Computing}, 1989, pages 833-842.  
%\newblock Also, to appear in {\em Information and Computation}.

\bibitem{Styer}
E. Styer.
\newblock Improving fast mutual exclusion.
\newblock Manuscript.

\bibitem{Merritt-Taubenfeld}
M. Merritt and G. Taubenfeld.
\newblock Speeding Lamport's fast mutual exclusion algorithm.
\newblock Manuscript.

\bibitem{Alur-Taubenfeld}
R. Alur and G. Taubenfeld.
\newblock Results about fast mutual exclusion
\newblock In {\em Proceedings of Real Time Systems Symposium}, Pheonix,
Arizona, 1992. 

\bibitem{MMT}
M. Merritt, F. Modugno and M. Tuttle.
\newblock Time-Constrained Automata.
\newblock In {\em Proceedings of 2nd 
%Intl. Conf. on Concurrency Theory,
CONCUR}, Amsterdam, The Netherland, August, 1991,
Springer-Verlag LNCS 527, pp. 408-423.

%\bibitem{aggarwal}
%\bibitem{CONCUR91}
%\bibitem{AttiyaL89}
%\bibitem{MerrittMT90}
%\bibitem{Her-Wing}

\bibitem{LynchT87}
N. Lynch and M. Tuttle.
\newblock Hierarchical correctness proofs for distributed algorithms.
\newblock In {\em Proceedings of the 6th PODC},
%Annual ACM Symposium on Principles of Distributed Computing}, 
August 1987, pp. 137-151. 
%\newblock Also, expanded version: Technical Memo MIT/LCS/TR-387,
%Laboratory for Computer Science, MIT, April, 1987.

\bibitem{LynchT89}
N. Lynch and M. Tuttle.
\newblock An introduction to {I}nput/{O}utput Automata.
\newblock {\em CWI-Quarterly}, No. 3, Vol. 2, September, 1989, pp.
219-246. 

\bibitem{Fischer-mutex}
M. Fischer. 
\newblock Personal communication.

\bibitem{FFpersonal}
F. Fich.
\newblock Personal communication.

\bibitem{LV-REX}
N. Lynch and F. Vaandrager.
\newblock Forward and backward simulations for timing-based systems.
\newblock In {\em Proceedings of {REX} {W}orkshop ``Real-Time:  Theory
in Practice,''} Mook, The Netherland, 1992.  {S}pringer-{V}erlag
{LNCS} 600.
%\newblock Also, Technical Memo MIT/LCS/TM-458, Laboratory for Computer
%Science, MIT, November, 1991. 

\bibitem{LS} 
N. Lynch and I. Saias. 
\newblock Proving probabilistic correctness statements:  the case of
{R}abin's algorithm for mutual exclusion.
\newblock In {\em Proceedings of the 11th Annual ACM Symposium on
Principles of Distributed Computing}, 1992.  
%\newblock Also, Technical Memo MIT/LCS/TM-462, Laboratory for Computer
%Science, MIT, December 1991. 

\bibitem{KL}
E. Kushilevits and M. Rabin.
\newblock Randomized mutual exclusion algorithms revisited.
\newblock In {\em Proceedings of the 11th 
%Annual ACM Symposium on
%Principles of Distributed Computing
PODC}, 1992.  

%\bibitem{AG88}
%J. H. Anderson, and M. G. Gouda,
%\newblock The virtue of patience: concurrent programming with and without %waiting
%\newblock Unpublished Manuscript, Dept. of Computer Science, Austin,
%Texas, January 1988.

%\bibitem{AG88}
%J. H. Anderson, and M. G. Gouda,
%\newblock The virtue of patience: concurrent programming with and without %waiting
%\newblock Unpublished Manuscript, Dept. of Computer Science, Austin,
%Texas, January 1988.

\bibitem{Dijkstra}
E.W. Dijkstra.
\newblock Solution of a problem in concurrent programming control.
\newblock {\em {C}ommunications Of The {ACM}}, 8:165, 1965.

%\bibitem{DGS88}
%D.~Dolev, E.~Gafni, and N.~Shavit.
%\newblock Towards a non-atomic era: $\ell$-exclusion as a test case.
%\newblock In {\em Proceedings of the $20^{th}$ Annual ACM Symposium
%on Theory of Computing}. ACM SIGACT, ACM, 1988.

%\bibitem{D65}
%E.W. Dijkstra.
%\newblock Solution of a problem in concurrent programming control.
%\newblock {\em Communications Of The ACM}, 8:165, 1965.

%\bibitem{DolevS89}
%D.~Dolev and N.~Shavit.
%\newblock Bounded concurrent time-stamp systems are constructible.
%\newblock In {\em Proceedings of the $21^{st}$ Annual ACM Symposium
%on Theory of Computing, Seattle, Washington}, pages 454--465. ACM
%SIGACT, ACM, 1989.

%\bibitem{FischerLBB79}
%M.~Fischer, N.~Lynch, J.~Burns, and A.~Borodin.
%\newblock Resource allocation with immunity to limited process failure.
%\newblock In {\em Proceedings of 20th FOCS}, pages 234--254, October 1979.
%\newblock {\em ACM Transactions on Programming Languages and
%Systems}, 11(1):90--114, January 1989.

%\bibitem{FischerLBB89}
%M.~Fischer, N.~Lynch, J.~Burns, and A.~Borodin.
%\newblock Distributed fifo allocation of identical resources using
%small shared space.

%\bibitem{H88}
%M. P. Herlihy.
%\newblock Wait free implementations of concurrent objects,
%\newblock In {\em Proc.\ 7th ACM Symp.\ on Principles of Distributed 
%Computing}, 1988, pp. 276--290.

\bibitem{Katseff}
H.~Katseff.
\newblock A new solution to the critical section problem.
\newblock In {\em Proceedings of the $10^{th}$ Annual ACM Symposium on
Theory of Computing}, pages 86--88. ACM, 1978.

\bibitem{Lamport-mutex}
L. Lamport.
\newblock A fast mutual exclusion algorithm.
\newblock {\em ACM Trans. on Comp. Systems}, 5(1):1-11, Feb. 87.

\bibitem{Lamport}
L.~Lamport.
\newblock A new solution of {D}ijkstra's concurrent programming 
problem.
\newblock {\em Communications of the ACM}, 78(8):453--455, 1974.

%\bibitem{Lamport-atom}
%L. Lamport.
%\newblock On interprocess communication, part I.  Basic formalism.
%\newblock {\em Distributed Computing 1, 2} 1986 pp.77-85.

\bibitem{Abadi-Lamport}
M. Abadi and L. Lamport.
\newblock An old fashioned Recipe for Real Time
\newblock In {\it Real Time: Theory in Practice, REX Workshop}, Springer
Verlag, pp. 1-27, 1991.  

%\bibitem{HW87}
%\bibitem{LynchT87b}
%bibitem{L86a}

%\bibitem{L86b}
%L. Lamport.
%\newblock On interprocess communication. Part II: Algorithms.
%\newblock {\em Distributed Computing 1, 2} 1986, pp. 86-101.

%\bibitem{L86d}
%Leslie Lamport.
%\newblock The mutual exclusion problem. Part {II}: Statement and 
%solutions.
%\newblock {\em J. ACM}, 33(2):327--348, 1986.

%\bibitem{P81}
%G.~L. Peterson.
%\newblock Myths about the mutual exclusion problem.
%\newblock {\em Information Processing Letters}, 12(3):115--116, 1981.

%\bibitem{P83}
%G. L. Peterson.
%\newblock Concurrent reading while writing.
%\newblock {\it ACM Transactions on Programming Languages and Systems,}
%\newblock Vol.\ 5, No.\ 1 (January 1983), pp.\ 46--55.

%\bibitem{P88}
%G.~Peterson.
%\newblock Personal Communication.
%\newblock Unpublished, 1988.

%\bibitem[Rud81]{Rudolph81}
%Larry Rudolph.
%\newblock {\em Software Structures for Ultra-Parallel Computing}.
%\newblock PhD thesis, New York University, 1981.

\bibitem{AttiyaLynch}
H. Attiya and N. Lynch.
\newblock Time bounds for real-time process control in the presence of
timing uncertainty.
\newblock In {\em Proceedings of the 10th RTSS},
%IEEE 
%Real-Time Systems
%Symposium}, 
Santa-Monica, December 1989, pp. 268--284.
%\newblock Expanded version: Technical Memo MIT/LCS/TM-403, Laboratory
%for Computer Science, MIT, July 1989.

%\bibitem{BP}
%J. Burns and G. Peterson.
%The Ambiguity of Choosing.
%{\em Proc.\ 8th ACM Symp. on Principles of Distributed Computing,}
%pp.\ 145--157, 1989.

%\bibitem{Lampson83}
%B. Lampson.
%Hints for Computer System Design.
%In {\em Proc.\ 9th ACM Symposium on Operating Systems Principles,}
%1983, pp.\ 33--48.

%\bibitem{PF}
%G. Peterson and M. Fischer.
%Economical Solutions for the Critical Section Problem in a
%Distributed System.
%In {\em Proc.\ 9th ACM Symp.\ on Theory of Computing,}
%1977, pp.\ 91--97.

%\bibitem{L76}
%L. Lamport.
%The Synchronization of Independent Processes.
%{\em Acta Informatica,}
%Vol.\ 7, No,\ 1 (1976), pp.\ 15--34.
} % end of small 
\end{thebibliography}



