LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 142-144 of 486
-
Linearizable Counting Networks
(1991-11)The counting problem requires n asynchronous processors to assign themselves successive values. A solution is linearizable if the order of the values assigned reflects the real-time order in which they were requested. ... -
Forward and Backward Simulations for Timing-based Systems
(1991-11)A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. As a first step, a comprehensive overview of simulation ...
