The Software Package BALM - The Unknown Component Problem: Theory and Applications - page 144

3. Compute mx min , the automaton obtained by the (state) minimization of mx .

4. Compute mx min prog , the largest progressive automaton contained in mx min .

Compare mx prog min vs mx min prog , and comment on their differences

if any.
5. Compute mx min prog min , the automaton obtained by the (state) minimization

of mx .

Compare mx prog min vs. mx min prog vs. mx min prog min ,andcom-

ment on their differences if any.

8.3. Consider the context FSM M A and the specification FSM M C whose descrip-

tions in kiss format are, respectively, the following:

.i 2
.o 2
.s 2
.p 8
.r a

i1 v1 a a u1 o1
i1 v1 a b u1 o3
i1 v1 a b u2 o1
i1 v2 a a u1 o2
i2 v2 a a u1 o2

i1 v1 b b u2 o3
i1 v2 b a u1 o2
i2 v1 b a u1 o1
.end
and

.i 1
.o 1
.s 2
.p 8
.r s1

i1 s1 s1 o2
i1 s1 s1 o3
i2 s1 s1 o2
i1 s1 s2 o1

i1 s2 s2 o3
i2 s2 s2 o1
i1 s2 s1 o2
i2 s2 s1 o2
.end