A combinatorial technique is introduced that can be applied to the analysis of a variety of framed, contention-based protocols of multiple access, with or without dynamic frame-length control. Furthermore, we consider a general capture model that includes the case of perfect capture, as well as capture models that depend on the number of packets involved in a collision. We demonstrate the application of our technique to several of these cases.