 
Summary: On the Implementation Complexity of
Specications of Concurrent Programs
Paul C. Attie 1
College of Computer Science, Northeastern University, Boston, MA
MIT Laboratory for Computer Science, Cambridge, MA
attie@ccs.neu.edu
http://www.ccs.neu.edu/home/attie/Attie.html
Abstract. We present a decision algorithm for the following problem:
given a specication, does there exist a concurrent program which both
satises the specication and which can be implemented in hardware
available operations in a straightforward manner, i.e, without long cor
rectness proofs, and without introducing excessive blocking and/or cen
tralization? In case our decision algorithm answers \yes," we also present
a synthesis method to produce such a program. We consider specica
tions expressed in branching time temporal logic. Our result gives a way
of classifying specications as either \easy to implement" or \diĘcult to
implement," and can be regarded as the rst step towards a notion of
\implementation complexity" of specications.
1 Introduction
One of the major approaches to the construction of correct concurrent programs
