Control dependence for extended finite state machines.

Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challenges that currently presents a barrier to wider application of state machine slicing is the problem of determining control dependence. We survey existing related denitions, introducing a new denition that subsumes one and extends another. We illustrate that by using this new denition our slices respect Weiser slicing's termination behaviour. We prove results that clarify the relationships between our denition and older ones, following this up with examples to motivate the need for these dierences