Formal Verification on the Safety of Internet of Vehicles Based on TPN and Z

Algorithm 1

The algorithm of accessibility. Accessibility decision from M_i to M_j.

	Input: , Mi, Mj, D^+, D^−
	Output: true (print the path); false
	Find the X, X =
	If X not exist, return false;
	Else
	For (k = 0; k< n; k++)
	;// store the different value of X, n is the number of X.
	is the root node;//built the reachability tree
	For (k = 1; k ≤ e; k++)
	{if ( , )
	is the child node of ;
	}//test the time constrain
	For(k = 0; k< n; k++)
	{If ( ) exist in one path of to ,
	Lookup(S, C); //find the relative and , test the logical relationship
	If the logical relationship from to is reasoned to be correct.
	Print ;
	}