




















































































Loading Util.tlv $Revision: 4.3 $
Loading MCTL.tlv $Revision: 4.3 $
Loading MCTLS.tlv $Revision: 4.1 $
Loading TESTER.tlv $Revision: 4.2 $
Loading MCsimple.tlv  $Revision: 4.2 $
Loading SIMULATE $Revision: 4.2 $
Loading Floyd.tlv $Revision: 4.1 $
Loading Abstract.tlv  $Revision: 4.2 $
Loading deductive.tlv $Revision: 4.2 $
















 Check Realizability

 Specification is realizable 

 Check that a symbolic strategy is correct

Transition relation is complete

 All winning states satisfy invariant

 Automaton States

State 1
In.action = nil,    In.T1.loc = 0,      In.S1.loc = 0,      In.S2.loc = 0,
Out.index = 0,

State 2
In.action = search, In.T1.loc = 0,      In.S1.loc = 0,      In.S2.loc = 0,
Out.index = 2,

State 3
In.action = display,In.T1.loc = 1,      In.S1.loc = 0,      In.S2.loc = 0,
Out.index = 1,

State 4
In.action = display,In.T1.loc = 1,      In.S1.loc = 0,      In.S2.loc = 1,
Out.index = 2,

State 5
In.action = search, In.T1.loc = 0,      In.S1.loc = 1,      In.S2.loc = 0,
Out.index = 2,

State 6
In.action = display,In.T1.loc = 1,      In.S1.loc = 1,      In.S2.loc = 0,
Out.index = 1,

State 7
In.action = display,In.T1.loc = 1,      In.S1.loc = 1,      In.S2.loc = 1,
Out.index = 2,


 Automaton Transitions

From 1 to  2
From 2 to  3 4
From 3 to  5
From 4 to  2
From 5 to  6 7
From 6 to  2
From 7 to  5

Automaton has 7 states, and 9 transitions

