## Petri net theory: a survey |

### From inside the book

2 pages matching **primitive recursive function** in this book

Where's the rest of this book?

Results 1-2 of 2

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

analysis arcs bisimulation called Chapter Coloured Petri Nets combinatorial components concession concurrent systems conflict corresponding Coverability Tree CR-path deadlock Definition denoted discrete dual dynamic behaviour elements enabled equivalent Example exists a marking finite firable formula Free Choice Free-Choice Nets function GVASS hence initial marking integers invariants label Lemma letter-quality printer live and safe live iff matrix maximal element morphism N-dense net's node notation notion occur occurrence nets P-completion P-net P,T,pre,post P,T,pre,post,Mo partially ordered set Petri Net model place-invariant poset pre{p,t primitive recursive function Proof Proposition Reachability Problem reachability set reachable marking relation represents restricted result safe nets set of places set of transitions simple cycles strongly connected strongly connected components structure subnet synchronic distance T-nets Theorem transition relation transitive closure trap unbounded Unmarked Petri upper bound VASS Vector Addition Systems weakly-discrete