Chapter 1 introduced one approach, FDNA, to quantitatively capture the interdependencies between a mission’s components under the assumption that the mission effectiveness is in [0, 100]. This chapter introduces a simple general framework capable of encapsulating FDNA and nearly all useful dependency representations as special cases. Hence, any future algorithm applied to this standardized near-universal representation of a mission will be applicable to the analysis of missions described using most other representations. This property will be illustrated with a mission network analysis from both an attacker and a defender perspective, using different dependency representations that can be explicitly shown as the special cases of the framework developed in this chapter.