Software Development in Java by Raj Kumar

Author:Raj Kumar [Kumar, Raj]
Language: eng
Format: mobi
Tags: Computers, Internet
Publisher: Silicon Press
Published: 2003-05-31T16:00:00+00:00

Figure 9.4 Cause-effect graph for “max” problem.

Returning to our example and Figure 9.4, we see that I1 is true iff C3, C5, and I12 are true. But, I12 is true iff C9 is false. So, I1 is true iff y < x and z < x and y ¹ z. I2 is true iff C3 and C6 are true, i.e., iff y < x and z < y. I3 is true iff C4 and C5 are true, i.e., iff y < z and z < x. Hence, when any one of I1, I2, and I3 is true, x = max{x, y, z}. Furthermore, the conditions under which I1, I2 and I3 are true cover all conditions under which the program for the “max” problem is to output x. Since E1 is an “or” node, the graph of Figure 9.4 implies that the effect E1 occurs whenever any one

(or more) of I1, I2, and I3 is true. Hence, the output x is produced exactly when x is the maximum and x, y, and z are distinct.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.