BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-92-515
       ENTRY:: November 02, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: PARTIAL ORDERINGS OF EVENT SETS AND THEIR APPLICATION TO
               PROTOTYPING CONCURRENT TIMED SYSTEMS
        TYPE:: Technical Report
      AUTHOR:: Luckham, David C.
      AUTHOR:: Vera, James
      AUTHOR:: Bryan, Doug
      AUTHOR:: Augustin, Larry
      AUTHOR:: Belz, Frank
        DATE:: April 1992
       PAGES:: 27
    ABSTRACT:: Rapide is a concurrent object-oriented language specifically
               designed for prototyping large concurrent systems. One of the
               principle design goals has been to adopt a computation model
               in which the synchronization, concurrency, dataflow, and
               timing aspects of a prototype are explicitly represented and
               easily accessible both to the prototype itself and to the
               prototyper. This paper describes the partially ordered event
               set (poset) computation model, and the features of Rapide for
               using posets in reactive prototypes and for automatically
               checking posets. Some critical issues in the implementation
               of Rapide are described and our experience with them is
               summarized. An example prototyping scenario illustrates uses
               of the poset computation model.
       NOTES:: [Adminitrivia V1/Prg/19941102]
         END:: STAN//CSL-TR-92-515