Report Number: CS-TR-85-1048
Institution: Stanford University, Department of Computer Science
Title: Some constructions for order-theoretic models of concurrency
Author: Pratt, Vaughan
Date: March 1985
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.