SRC Research Report 132

Processes are in the Eye of the Beholder

Leslie Lamport

A two-process algorithm is shown to be equivalent to an N-process one, illustrating the insubstantiality of processes. A completely formal equivalence proof in TLA (the Temporal Logic of Actions) is sketched.

Back to the SRC Research Reports main page.

• PostScript compressed with UNIX compress -- 99 Kbytes
  
• PostScript compressed with GNU compress (gzip) -- 72 Kbytes
  
• PostScript compressed with ZIP -- 72 Kbytes
  
• PostScript -- 264 Kbytes
  
• Portable Document Format (PDF) -- 288 Kbytes