In Section 9.3.3 we argued that if the framework has finite height, then the iterative algorithm converges. Here is an example where the framework does not have finite height, and the iterative...

In Section 9.3.3 we argued that if the framework has finite height, then the iterative algorithm converges. Here is an example where the framework does not have finite height, and the iterative algorithm does not converge. Let the set of values V be the nonnegative real numbers, and let the meet operator be the minimum. There are three transfer functions:

The set of transfer functions F is these three plus the functions formed by composing them in all possible ways.


a) Describe the set F.

b) What is the <>

c) Give an example of a flow graph with assigned transfer functions, such that Algorithm 9.25 does not converge.


d) Is this framework monotone? Is it distributive?