The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an efficient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework.

In  J. UCS

Publisher  Springer Verlag
All copyrights reserved by Springer 2007.

Details