A framework for comparing models of computation

摘要: We give a denotational framework (a "meta model") within which certain properties of models computation can be compared. It describes concurrent processes in general terms as sets possible behaviors. A process is determinate if, given the constraints imposed by inputs, there are exactly one or zero Compositions with behaviors intersection component processes. The interaction between through signals, collections events. Each event value-tag pair, where tags come from partially ordered totally set. Timed set ordered. Synchronous events share same tag, and synchronous signals contain tags. have only Strict causality (in timed tag systems) continuity untimed ensure determinacy under technical conditions. used to compare essential features various computation, including Kahn networks, dataflow, sequential processes, rendezvous, Petri nets, discrete-event systems.