In this paper we define a process algebra abstracting relevant features of the Linda paradigm to parallel computation and show how to give it a semantics based on higher-dimensional automata which is more expressive than interleaving transition systems. In particular, it is a truly concurrent operational semantics, compositional in nature. Furthermore this semantics leads us to new kinds of abstract interpretations useful for the static analysis of concurrency. One of these addresses the correctness of implementations of Linda programs on real computers (which have a finite number of processors).
Cridlig, R., & Goubault, E. (1993). Semantics and analysis of linda-based languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 724 LNCS, pp. 72–86). Springer Verlag. https://doi.org/10.1007/3-540-57264-3_30