We present two abstract machines for innocent interaction. The first, a rather complicated machine, operates directly on innocent strategies. The second, a far simpler machine, requires a “compilation” of the innocent strategies into “cellular” strategies before use. Given two innocent strategies, we get the same final result if we make them interact using the first machine or if we first cellularize them then use the other machine
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.