A social network/sensor network can be modelled as follows:

Group A:
cycle₁: [guard₁,A] P0 +adap= P1 -enum< P2 >elim- P3 =prop+ P4
...
cycle_n: [guard_n,A] P0 +adap= P1 -enum< P2 >elim- P3 =prop+ P4

Group B:
cycle₁: [guard₁,B] P0 +adap= P1 -enum< P2 >elim- P3 =prop+ P4
...
cycle_m: [guard_m,B] P0 +adap= P1 -enum< P2 >elim- P3 =prop+ P4

The sets A, B, ... may overlap.

   A,  A,  A, B, B, B,  C,  C, C, C
   A,  A, AB, B, B, B, BC, BC, C, C
   A,  A, AB, AB,B, B,  B, BC, C, C

When the conditions are right, resonance may be achieved. On the other hand, one social group can conquer another social group. The Abstract Machine System may be stable or unstable.

(This topic is an excellent class project)