O2M Theorem

o2m maps distributed object rewrite theories to meta-

object tower rewrite theories by rerouting message

delivery and send through the in and out attributes.

Theorem:

For a distributed object configuration oCf:

oCf and o2m(oCf)

are observationally equivalent -- computations correspond

via bijections between

• message delivery in oCf and processing from the input queue in o2m(oCf)

• message and object creation and processing of the output queue

Previous slide

Next slide

Back to first slide

View graphic version