PTnet Definitions - Subnets
20/3/2014
CE-653 - PTnet Theory and some Algorithms
8
}Definition [S-Components and T-Components]:
}N’ = (S’, T’, F’) is a subnet of N = (S, T, F) iff
S’ ≤ S, T’ ≤ T and F’ = F ∩ ((S’ x T’) U (T’ x S’))
}
}N’ is an S-component (T-component) of N iff
N’ is a strongly connected S-graph (T-graph) and|
T’ = •S’∩S’• (S’ = •T’∩T’•).
}
}N’ is generated by a set X’ ≤ S ∩ T iff:
 S’ = (X’ ∩ S) U •(X’ ∩ T) U (X’ ∩ T)•
 T’ = (X’ ∩ T) U •(X’ ∩ S) U (X’ ∩ S)•
}