
























































































































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,
In.S3.loc = 0,      Out.index = 0,

State 2
In.action = a,      In.T1.loc = 0,      In.S1.loc = 0,      In.S2.loc = 0,
In.S3.loc = 0,      Out.index = 1,

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

State 4
In.action = b,      In.T1.loc = 1,      In.S1.loc = 1,      In.S2.loc = 0,
In.S3.loc = 0,      Out.index = 1,

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

State 6
In.action = k,      In.T1.loc = 3,      In.S1.loc = 1,      In.S2.loc = 0,
In.S3.loc = 1,      Out.index = 2,

State 7
In.action = h,      In.T1.loc = 4,      In.S1.loc = 1,      In.S2.loc = 1,
In.S3.loc = 1,      Out.index = 2,

State 8
In.action = p,      In.T1.loc = 4,      In.S1.loc = 1,      In.S2.loc = 1,
In.S3.loc = 1,      Out.index = 3,

State 9
In.action = b,      In.T1.loc = 5,      In.S1.loc = 1,      In.S2.loc = 1,
In.S3.loc = 0,      Out.index = 1,

State 10
In.action = p,      In.T1.loc = 6,      In.S1.loc = 2,      In.S2.loc = 1,
In.S3.loc = 0,      Out.index = 3,

State 11
In.action = h,      In.T1.loc = 4,      In.S1.loc = 2,      In.S2.loc = 1,
In.S3.loc = 1,      Out.index = 2,

State 12
In.action = p,      In.T1.loc = 4,      In.S1.loc = 2,      In.S2.loc = 1,
In.S3.loc = 1,      Out.index = 3,

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

State 14
In.action = p,      In.T1.loc = 7,      In.S1.loc = 2,      In.S2.loc = 0,
In.S3.loc = 1,      Out.index = 3,

State 15
In.action = p,      In.T1.loc = 7,      In.S1.loc = 1,      In.S2.loc = 0,
In.S3.loc = 1,      Out.index = 3,

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


 Automaton Transitions

From 1 to  2
From 2 to  3 4
From 3 to  6
From 4 to  5
From 5 to  5
From 6 to  7 8
From 7 to  15
From 8 to  9
From 9 to  10
From 10 to  11 12
From 11 to  14
From 12 to  13
From 13 to  10
From 14 to  5
From 15 to  16
From 16 to  16

Automaton has 16 states, and 19 transitions

