Functorial models for contextual pre-nets
The algebraic models of computation for contextual nets that have
been proposed in the literature either rely on non-free monoid of
objects, or introduce too many behaviors that must be somewhat
filtered out. In this report, we exploit partial membership
equational logic to define a suitable theory of models, where the
meaningful concurrent computations can be selected by means of
membership predicates.