Full abstraction for Linda

This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and re-moving messages from a shared memory, local choice, parallel composition and recursion. The second one adds the possibility of checking for the absence of a message in the store. After having defined a denotational semantics based on traces, we obtain fully abstract semantics for both languages by using suitable abstractions in order to identify different traces which do not correspond to different operational behaviours.