Original system
¬(x1≡x2) v ¬(x1≡x3)^(¬x2 v x3) =1
¬(x3≡x4) v ¬(x3≡x5)^(¬x4 v x5) =1
¬(x5≡x6) v ¬(x5≡x7)^(¬x6 v x7) =1
¬(x7≡x8) v ¬(x7≡x9)^(¬x8 v x9) =1
Convert to equivalent (verification basic knowledge of Boolean Algebra )
(x1≡x2) => (x1⊕x3)^(x2=>x3) =1
(x3≡x4) => (x3⊕x5)^(x4=>x5) =1
(x5≡x6) => (x5⊕x7)^(x6=>x7) =1
(x7≡x8) => (x7⊕x9)^(x8=>x9) =1
Here we have transition variables x3,x5,x7 rather then transition pairs
between equations. Thus we would manage via 08.2016 charts.
¬(x1≡x2) v ¬(x1≡x3)^(¬x2 v x3) =1
¬(x3≡x4) v ¬(x3≡x5)^(¬x4 v x5) =1
¬(x5≡x6) v ¬(x5≡x7)^(¬x6 v x7) =1
¬(x7≡x8) v ¬(x7≡x9)^(¬x8 v x9) =1
Convert to equivalent (verification basic knowledge of Boolean Algebra )
(x1≡x2) => (x1⊕x3)^(x2=>x3) =1
(x3≡x4) => (x3⊕x5)^(x4=>x5) =1
(x5≡x6) => (x5⊕x7)^(x6=>x7) =1
(x7≡x8) => (x7⊕x9)^(x8=>x9) =1
Here we have transition variables x3,x5,x7 rather then transition pairs
between equations. Thus we would manage via 08.2016 charts.
No comments:
Post a Comment