PTnet Definitions
20/3/2014
CE-653 - PTnet Theory and some Algorithms
4
}A transition t in T is enabled at marking M iff:
}For all p in •t: M(p) > 0
}
}When t fires at M a new marking M’ is produced:
}M’(p) = M(p) – F(p, t) + F(t, p) (F is characteristic function of F)
}M[t>M’ denotes that M’ is reachable from M by the
occurrence of transition t
}
}The set of markings reachable from the initial marking M0 by the occurrence of a sequence of transitions
σ = t1t2…tn =is denoted by R(N, M0)