25/9/17:

1. Output drawing system modified according to the process.

include/drawsystem.h

@@ -17,8 +17,9 @@ class transition{
 	
 	int guard; // Let i-th bit of guard from right hand is g_i
 	int reset; // Let i-th bit of reset from right hand is r_i
-	/*
-	0-th bit of gurad and reset is for stack operation
+	int openl; // i-th bit openl is 1 iff lower bound of constraint for clock i is open
+        int openu; // i-th bit openr is 1 iff upper bound of constraint for clock i is open
+	/*0-th bit of gurad and reset is for stack operation
 	1 to 15-th bits are for clock(15 clock supported)
 	
 	g_i=1(1<=i<=15) : i-th clock is checked in this transition

input/sample

@@ -5,17 +5,17 @@
 4
 
 1 2 0 1 1
-2 2 3
+2 2 0 3 0
 1
 1 1
 
 1 4 0 0 0
-2 2 2 2
+2 2 2 0 2 0
 
 2 3 0 2 0
-1 0 2
-2 1 2
-3 1 0 2 2
+1 0 0 2 0
+2 1 0 2 0
+3 1 0 0 2 0 2
 
 3 1 0 0 2
 1 2
@@ -59,23 +59,27 @@ INPUT FORMAT(Ignore blank lines and spaces) :
 			action : 0(action is not important for us, just put 0 in place of action)
 			#guards : number of clock checks are there
 			#resets : number of clock reset at this transition
-	If number of clock check(#guards) is m, then each of the next m lines will have three space separated intergers : <clock_number> <lower_bound> <upper_bound>
+	If number of clock check(#guards) is m, then each of the next m lines will have 5 space separated intergers : <clock_number> <lower_bound> <open/close> <upper_bound> <open/close>
 		clock_number : clock(x) for which there is a check in this transition
 		lower bound : x >= lower_bound is the lower bound constraint
+		open/close: 0 if the bound is close and 1 if the bound is open
 		upper bound : x <= upper_bound is the upper bound constraint
+		open/close: 0 if the bound is closed and 1 if the bound is open
 		overall the constraint is lower_bound <= x <= upper_bound
 
 	If number of clock reset at this transition is n, then the next line has n space separated integers : Each integer is a clocks_number has been reset in this transition
 
-	Last line of the input can contain maximum 5 space separated integers : <stack_op> 
+	Last line of the input can contain maximum 7 space separated integers : <stack_op> 
 	The value of first integer determine the stack operation
 	First interger is 0 : no stack operation
 	First interger is 1 : Only stack push operation, This integer will be followed by another integer : <stack_symbol_2>
-	First interger is 2 : Only stack pop operation, This integer will be followed by another three space separated integers : <stack_symbol> <lower_bound> <upper_bound>
+	First interger is 2 : Only stack pop operation, This integer will be followed by another five space separated integers : <stack_symbol> <lower_bound> <open/close> <upper_bound> <open/close>
 	First interger is 3 : Both pop and push happens at this transition, This integer will be followed by another four space separated integers : <stack_symbol> <lower_bound> <upper_bound> <stack_symbol_2>
 	where
 		<stack_symbol> : stack symbol number popped in this transition
 		<lower_bound> : lower bound on the age of the stack symbol currently popped in this transition
+		<open/close>: openness and closed ness of the bound
 		<upper_bound> : lower bound on the age of the stack symbol currently popped in this transition
+		<open/close>: openness and close ness of the bound.
 		<stack_symbol_2> : stack symbol number pushed in this transition		
 

src/tpdaCGPP.cpp

@@ -495,6 +495,7 @@ vector<stateGCPP*> stateGCPP::addNextTPDA() {
                     //assume the relation of fraction part with respect to the new system.
                     //first assume it to be \leq
                     rs->r_matrix = rs->allocate_r_matrix();// do we need to allocate? or it is sufficent to just point?
+                        //I have to allocate because this is changing
                     //How to propagate values??
                     //vs->r_matrix;