User loginNavigation 
A Framework for Comparing Models of Computation
A Framework for Comparing Models of Computation by Edward A. Lee and Alberto SangiovanniVincentelli, 1998.
We give a denotational framework (a â€œmeta modelâ€) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly one or exactly zero behaviors. Compositions of processes are processes with behaviors in the intersection of the behaviors of the component processes. The interaction between processes is through signals, which are collections of events. Each event is a valuetag pair, where the tags can come from a partially ordered or totally ordered set. Timed models are where the set of tags is totally ordered. Synchronous events share the same tag, and synchronous signals contain events with the same set of tags. Synchronous processes have only synchronous signals as behaviors. Strict causality (in timed tag systems) and continuity (in untimed tag systems) ensure determinacy under certain technical conditions. The framework is used to compare certain essential features of various models of computation, including Kahn process networks, dataflow, sequential processes, concurrent sequential processes with rendezvous, Petri nets, and discreteevent systems.The generality of the approach looks very impressive. Can anyone share firsthand experience with this framework? Would be great to see E compared to Oz! By Andris Birkmanis at 20080911 15:02  Parallel/Distributed  Semantics  other blogs  7142 reads

Browse archivesActive forum topics 
Recent comments
4 hours 58 min ago
13 hours 53 min ago
1 day 49 min ago
1 day 2 hours ago
1 day 2 hours ago
1 day 3 hours ago
1 day 3 hours ago
1 day 5 hours ago
1 day 7 hours ago
1 day 9 hours ago