Hi Boaz:

An ICSE '99 reviewer of the Persephone paper proposed the following
definition of an embedded strategy graph:

Given a graph G, an embedded strategy graph S of G is any
subgraph of the transitive closure of G.

This definition guarantees that S is compatible with G.

This is the first time I see a definition of strategy graphs
that is _very_ easy to understand.

The definition includes the definition of path expansion and the
definition of compatability!

Can we make it even more elegant? It might be good to use
this idea in our strategies paper?

-- Karl