















































































































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 = search, In.T1.loc = 0,      In.S1.loc = 0,      In.S2.loc = 0,
In.S3.loc = 0,      Out.index = 3,

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

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

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

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

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

State 8
In.action = nil,    In.T1.loc = 4,      In.S1.loc = 0,      In.S2.loc = 0,
In.S3.loc = 2,      Out.index = 3,

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

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

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

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

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

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

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

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

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

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


 Automaton Transitions

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

Automaton has 18 states, and 39 transitions

