“…Interesting results have been obtained recently indicating that those techniques can be quite useful in the concurrent context too, thus being potentially interesting for CBUS. Results in this direction have been published in [34], [25], [35], [36], [55], [32], [29], [14], [15], [50] In [34], techniques ensuring termination combining tools coming from term rewriting with logical relations are introduced and exploited in the context of a π-calculus with functional and imperative names. Noticeably, the introduced technique allows to capture a large class of programs and processes.…”