BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-83-964
       ENTRY:: May 29, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Proving precedence properties: the temporal way
        TYPE:: Technical Report
      AUTHOR:: Manna, Zohar
      AUTHOR:: Pnueli, Amir
        DATE:: April 1983
       PAGES:: 40
    ABSTRACT:: This paper explores the three important classes of temporal
               properties of concurrent programs: invariance, liveness and
               precedence. It presents the first methodological approach to
               the precedence properties, while providing a review of the
               invariance and liveness properties. The approach is based on
               the 'unless' operator, which is a weak version of the 'until'
               operator. For each class of properties, we present a single
               complete proof principle. Finally, we show that the
               properties of each class are decidable over finite state
               programs.
       NOTES:: [Adminitrivia V1/Prg/19950529]
         END:: STAN//CS-TR-83-964