Computation of Flexibility in Sequential Networks - The Unknown Component Problem: Theory and Applications - page 166

The automaton is complete (4 states) and deterministic.
3 inputs 4 states 10 transitions
Inputs = { x, y, o}

s0

000

s1

-00 011

000 -11

s2 000 101

101 -11

s5

-11

Fig. 10.2 Graphical output of BALM showing the automaton MBifsm.aut generated by the
script K&N script - example MA.mv MB.mv . The first two variables are the internal
signals x;y , whereas the third variables is the external output o

The automaton is incomplete (3 states) and deterministic.
3 inputs 4 states 8 transitions
Inputs = { x, y, o}

s0

000

1--

s1 -00 011 DC ---

-11 000

-11

s4

101

Fig. 10.3 Graphical output of BALM showing the automaton xfsm min.aut generated by
the script Largest solution script - example spec.mv MB.mv that computes the
largest solution

10.2 The Wang-Brayton's Procedure

H.-Y. Wang and R. Brayton [139] extended the method of Kim and Newborn to
include the case where M B had a feedback connection to M A . This configuration
is shown in Fig. 10.4 . This theory also applies in the case where the output o is
produced by M A .