Introduction to Petri Net Theory

@inproceedings{Yen2006IntroductionTP,
  title={Introduction to Petri Net Theory},
  author={Hsu-Chun Yen},
  booktitle={Recent Advances in Formal Languages and Applications},
  year={2006}
}
This paper gives an overview of Petri net theory from an algorithmic viewpoint. We survey a number of analytical techniques as well as decidability/complexity results for various Petri net problems. 
Highly Cited
This paper has 29 citations. REVIEW CITATIONS
19 Citations
66 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 66 references

The reachability problem requires exponential space, Technical Report

  • R. Lipton
  • Yale University, Dept. of CS.,
  • 1976
Highly Influential
7 Excerpts

Hilbert’s tenth problem is unsolvable

  • M. Davis
  • American Mathematical Monthly 80:233-269,
  • 1973
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…