Petri Net Theory: A Survey |
Common terms and phrases
analysis arcs bisimulation called Coloured Petri Nets combinatorial components Computer Science concurrent systems conflict Coverability Tree CR-path deadlock defined Definition denoted dynamic behaviour equivalent events A₁ Example figure finite firable Free Choice Free-Choice Nets function GVASS initial marking integers invariants label Lecture Notes Lemma live and safe live iff M₁ maximal element morphism multiset N-dense net's node Notes in Computer notion occur occurrence net occurrence nets P-completion P-net P,T,pre partially ordered set Petri Net model place-invariant poset post(p pre(p Project MAC Proof properties Reachability Problem reachable marking relation restricted result safe nets sequence set of places set of transitions simple cycles Springer-Verlag strongly connected strongly connected components structure subnet synchronic distance T-nets T₂ Theorem transition relation transitive closure trap Unmarked Petri VASS Vector Addition Systems