build a reachability graph based on a forwards pta traversal . all zones in the symbolic states in the graph are guaranteed to be convex i.e. dbms . the set of target states found and the singleton set of initial states are stored separately and can be obtained subsequently using gettarget and getinitialstates . concode_field_sep PrismLog mainLog concode_elem_sep List<Integer> initialStates concode_elem_sep BitSet targetLocs concode_elem_sep Constraint targetConstraint concode_elem_sep BitSet target concode_field_sep BitSet getTarget concode_elem_sep ReachabilityGraph buildForwardsGraphFormats10 concode_elem_sep ReachabilityGraph buildForwardsGraphFormats09 concode_elem_sep List<Integer> getInitialStates
ReachabilityGraph function ( PTA arg0 , BitSet arg1 , Constraint arg2 ) { return buildForwardsGraphFormats10 ( arg0 , arg1 , arg2 ) ; }