Commit 344b66eb authored by SPARSA ROYCHOWDHURY's avatar SPARSA ROYCHOWDHURY

3/11/2017:

1. some bug fixedd

Sparsa Roychowdhury
parent 0991be00
No preview for this file type
5 6 1 0 1
1
5
1 2 0 0 1
1
1 1
1 3 0 1 0
1 3 0 -1 0
0
2 3 0 1 0
1 1 0 -1 0
0
3 4 0 1 0
1 3 0 100 0
0
3 5 0 1 0
1 0 0 2 0
0
4 5 0 0 0
2 1 2 0 3 1
00 00
|X| = 1
|T| = 2
|M| = 9
...@@ -8,8 +8,8 @@ digraph finite_state_machine { ...@@ -8,8 +8,8 @@ digraph finite_state_machine {
1 -> 5 [ label = "{tn:2,1<=x1<=2,pp_2,6<=ag(2)<=8}" ]; 1 -> 5 [ label = "{tn:2,1<=x1<=2,pp_2,6<=ag(2)<=8}" ];
2 -> 1 [ label = "{tn:3}" ]; 2 -> 1 [ label = "{tn:3}" ];
2 -> 2 [ label = "{tn:4,1<=x1<=1,x1:=0,ps_1}" ]; 2 -> 2 [ label = "{tn:4,1<=x1<=1,x1:=0,ps_1}" ];
2 -> 3 [ label = "{tn:5,0<=x1<=1}" ]; 2 -> 3 [ label = "{tn:5,0<=x1<1}" ];
3 -> 4 [ label = "{tn:6}" ]; 3 -> 4 [ label = "{tn:6}" ];
4 -> 2 [ label = "{tn:7,0<=x1<=2}" ]; 4 -> 2 [ label = "{tn:7,0<=x1<=2}" ];
4 -> 4 [ label = "{tn:8,pp_1,1<=ag(1)<=2}" ]; 4 -> 4 [ label = "{tn:8,pp_1,1<=ag(1)<2}" ];
} }
\ No newline at end of file
input1/tp63.png

52.1 KB | W: | H:

input1/tp63.png

51.8 KB | W: | H:

input1/tp63.png
input1/tp63.png
input1/tp63.png
input1/tp63.png
  • 2-up
  • Swipe
  • Onion skin
5 8 1 2 2
1
5
1 2 0 0 0
1 2
1 5 0 1 0
1 1 0 2 0
2 2 6 0 8 0
2 1 0 0 0
0
2 2 0 1 1
1 1 0 1 0
1
1 1
2 3 0 1 0
1 0 0 1 1
0
3 4 0 0 0
0
4 2 0 1 0
1 0 0 2 0
0
4 4 0 0 0
2 1 1 1 2 1
5 4 1 1 1
1
5
1 2 0 0 0
0
2 3 0 0 0
1 1
3 4 0 0 0
2 1 1 0 2 0
4 5 0 0 0
3 1 0 0 -1 0 1
digraph finite_state_machine {
node [shape = point ]; qi0;
node [shape = doublecircle];5;
node [shape=circle];
qi0 -> 0;
0 -> 1 [ label = "{tn:0,x1:=0}" ];
1 -> 2 [ label = "{tn:1}" ];
2 -> 3 [ label = "{tn:2,ps_1}" ];
3 -> 4 [ label = "{tn:3,pp_1,1<=ag(1)<=2}" ];
4 -> 5 [ label = "{tn:4,pp_1,0<=ag(1)<=inf,ps_1}" ];
}
\ No newline at end of file
14 26 1 1 2
1
1
1 2 0 0 0
1 1
2 3 0 0 0
0
3 2 0 0 0
0
3 4 0 0 0
0
4 3 0 0 0
0
4 5 0 0 0
0
5 4 0 0 0
0
5 6 0 0 0
0
6 5 0 0 0
0
6 7 0 0 0
0
7 6 0 0 0
0
7 8 0 0 0
0
8 7 0 0 0
0
8 9 0 0 0
0
9 8 0 0 0
0
9 10 0 0 0
0
10 9 0 0 0
0
10 11 0 0 0
0
11 10 0 0 0
0
11 12 0 0 0
0
12 11 0 0 0
0
12 13 0 0 0
0
13 12 0 0 0
0
13 14 0 0 0
0
14 13 0 0 0
0
2 1 0 1 0
1 6 0 10 0
2 1 11 0 15 0
T Time
2 0.000355
4 0.134996
6 0.223448
8 0.281873
10 0.381145
12 0.526717
14 0.650515
16 0.772484
18 0.836541
20 1.01429
22 1.04948
24 1.15572
26 1.26705
digraph finite_state_machine {
node [shape = point ]; qi0;
node [shape = doublecircle];1;
node [shape=circle];
qi0 -> 0;
0 -> 1 [ label = "{tn:0,x1:=0}" ];
1 -> 2 [ label = "{tn:1,ps_1}" ];
2 -> 3 [ label = "{tn:2}" ];
3 -> 2 [ label = "{tn:3}" ];
3 -> 4 [ label = "{tn:4}" ];
4 -> 3 [ label = "{tn:5}" ];
4 -> 5 [ label = "{tn:6}" ];
5 -> 4 [ label = "{tn:7}" ];
5 -> 6 [ label = "{tn:8}" ];
6 -> 5 [ label = "{tn:9}" ];
6 -> 7 [ label = "{tn:10}" ];
7 -> 6 [ label = "{tn:11}" ];
7 -> 8 [ label = "{tn:12}" ];
8 -> 7 [ label = "{tn:13}" ];
8 -> 9 [ label = "{tn:14}" ];
9 -> 8 [ label = "{tn:15}" ];
9 -> 10 [ label = "{tn:16}" ];
10 -> 9 [ label = "{tn:17}" ];
10 -> 11 [ label = "{tn:18}" ];
11 -> 10 [ label = "{tn:19}" ];
11 -> 12 [ label = "{tn:20}" ];
12 -> 11 [ label = "{tn:21}" ];
12 -> 13 [ label = "{tn:22}" ];
13 -> 12 [ label = "{tn:23}" ];
13 -> 14 [ label = "{tn:24}" ];
14 -> 13 [ label = "{tn:25}" ];
2 -> 1 [ label = "{tn:26,6<=x1<=10,pp_1,11<=ag(1)<=15}" ];
}
\ No newline at end of file
8 7 1 0 2
1
8
1 2 0 0 1
1
0
2 3 0 0 0
1 1
3 4 0 0 1
1
3 1 1 0 1 0 2
4 5 0 0 0
2 2 1 0 -1 1
5 6 0 0 1
1
0
6 7 0 0 0
1 1
7 8 0 0 0
2 1 1 0 -1 0
0 0 0
0 0 0
...@@ -1907,6 +1907,7 @@ stateGCPP* stateGCPP::reduce2(char dn,char wn,short* clockDis,bool* clockAcc,sho ...@@ -1907,6 +1907,7 @@ stateGCPP* stateGCPP::reduce2(char dn,char wn,short* clockDis,bool* clockAcc,sho
reset = transitions[ del[i] ].reset; // reset at i+1-th point reset = transitions[ del[i] ].reset; // reset at i+1-th point
if( reset & (~curReset) & (~1) ) { if( reset & (~curReset) & (~1) ) {
curReset |= reset; // the 'curReset' will have more bit with value '1'
vs->del[j] = del[i]; // i-th index trans will be part of new state at j-th index vs->del[j] = del[i]; // i-th index trans will be part of new state at j-th index
vs->w[j] = w[i]; // i-th index tsm will be part of new state at j-th index vs->w[j] = w[i]; // i-th index tsm will be part of new state at j-th index
map[j]=i; map[j]=i;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment