PTnet
Definitions – Net Subclasses
20/3/2014
CE-653 - PTnet Theory and some
Algorithms
5
}Definition [S-graph – State
Machine]:
}A net N = (S, T, F) is
called an S-graph or State Machine, iff each transition has exactly
one input place and one output place
}for all t in T: |•t| = 1
= |t•|
}Definition [T-graph – Signal
Transition Graph]:
}A net N = (S, T, F) is
called an T-graph or STG, iff each place has exactly one input
transition and one output transition
}for all s in S: |•s| = 1
= |s•|