A generic algorithm for simulating communications software in the network environment, based on the model of plural Abstract State Machines (ASMs) is discussed. Other properties and behaviors can supplement the generic case, for example, network topology, delaying behaviors, message transport reliability, and message priority. Plural executing agents, each a sequential abstract state machine, are combined to simulate the behavior of a dynamic network environment. Agent and message behavior is altered based on the proposed or selected network under simulation. The desired behaviors and constraints are coded, compiled, and executed using an executable abstract state machine language.