In this paper we consider consensus protocols where an agent might not be influenced by any of his neighbors singularly taken, but could be sensitive to the simultaneous and coherent influence of two or more of them (joint-agent interaction). By abstracting the set of interactions as a Petri Net we provide a graph-theoretical characterization of the ability of the net to attain asymptotic consensus within the considered set-up.