Computing the Behaviour of Asynchronous Processes

We describe a variation of Brock-Ackerman's (1981) model of nondeterministic asynchronous process, and devise a computational method for characterizing asynchronous processes defined by networks. This method is shown to be equivalent to a method of combining traces related to that of Brock and Ackerman. Recursively defined networks are also considered.