Hi Johan:

>From johan@ccs.neu.edu Wed Jul  1 19:30:21 1998
>To: Karl Lieberherr <lieber@ccs.neu.edu>
>Subject: Re: checking conformance 
>From: Johan Ovlinger <johan@ccs.neu.edu>
>
>you'll have to be more specific. Please formalise the derivation of
>the algorithm in particular, I am not clear about: 
>
> If for a path in the strategy graph there is no expanding path
> in the class graph then there must be a single edge in the
> strategy graph which does not have an expanding path in the class graph.
>

If the path is broken then there must be at least one edge where
it is broken.

>
> If each strategy graph edge has an expanding path then
> also each strategy graph path has an expanding path.

If none of the edges is broken, then the path cannot be broken.

Hope this helps.

>
>Also, why is the algorithm that I proposed not acceptable? I honestly
>thought the debate was over. (I'll have that out by later on tonight)

My hope is that your algorithm for and
definition of conformance coincides with mine. :-)
I don't question your algorithm since I have not seen it in writing yet.

>
>Johan
>


-- Karl