BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-85-1048
       ENTRY:: May 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Some constructions for order-theoretic models of concurrency
        TYPE:: Technical Report
      AUTHOR:: Pratt, Vaughan
        DATE:: March 1985
       PAGES:: 20
    ABSTRACT:: We give "tight" and "loose" constructions suitable for
               specifying processes represented as sets of pomsets
               (partially ordered multisets). The tight construction is
               suitable for specifying "primitive" processes; it introduces
               the dual notions of concurrence and orthocurrence. The loose
               construction specifies a process in terms of a net of
               communicating subprocesses; it introduces lhe notion of a
               utilization embedding a process in a net.
       NOTES:: [Adminitrivia V1/Prg/19950501]
         END:: STAN//CS-TR-85-1048