PTnet
Definitions
20/3/2014
CE-653 - PTnet Theory and some
Algorithms
3
}Definition [PTnet]:
}A Place Transition net
(or PTnet) is a triple N = (S, T, F), where
}S is the set of places,
}T is the set of transitions (S ∩T = Ø)
}F ≤ (S x T) U (T x
S) is the flow relation
}Elements of S U T are
called nodes
}pre-set •x of x in (S U T) is given
by
}•x = {y in S U T | (y, x)
in F}
}post-set x• of x in (S U T) is given
by
}x• = {y in S U T | (x, y)
in F}
}A Marking M is a function M: SàN
}A Marked PTnet <N,
M0> is a PTnet with an initial marking