The objective of this paper is twofold. First we modify and extend the definition of the
Algebraic Term Nets, introduced in precedent paper, in order to make them concurrent
objects. Then we give them an interpretation in terms of rewrite logic. The proposed logic
acts as an axiomatisation allowing us to study the behavior of the Algebraic Term nets by
deduction in such a logic. Moreover we present and discuss a general approach allowing us to
write the axioms in such a way that our nets are executed coherently and with a maximum of
true concurrency.
Abstract data types, high level Petri nets, true concurrency, rewrite logic.