19/10/17:

1. New idea started to implement

include/tpdaCGPP.h

@@ -42,7 +42,7 @@ class stateGCPP{
 	
 	// add transition 'dn' to this state and then forget some points if possible, return the new state, tsm value of last point not decided yet
 	stateGCPP* reduce(char dn);
-	
+	stateGCPP* nextDummy(char dn);
 	// return true iff clock gurards on new transition 'dn' with tsm value 'wn' is satisfied
 	bool consSatisfied(stateGCPP* vs,char dn, char wn, short *clockDis, bool *clockAcc);
 	

src/tpdaCGPP.cpp

@@ -732,7 +732,10 @@ vector<stateGCPP*> stateGCPP::addNextTPDA() {
     return v;
 }
 
-
+stateGCPP* stateGCPP::nextDummy(char dn){
+    //this function adds the new transition without removing any points.
+    //then check if the returned thing works or not.
+}
 // Return template successor state whose descendent states will be right states for shuffle operation with this state
 stateGCPP* stateGCPP::sucState(){