Author:
Dufourd Catherine,Finkel Alain
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. TCS, 3(1):85–104, 1977.
2. Z. Bouziane. Algorithmes primitifs récursifs et problèmes
Expspace-complets pour les réseaux de Petri cycliques. PhD thesis, LSV, école Normale Supérieure de Cachan, France, November 1996.
3. E. Cardoza, R. Lipton, and A. Meyer. Exponential space complete problems for Petri nets and commutative semigroups. In Proc. of the 8th annual ACM Symposium on theory of computing, pages 50–54, May 1976.
4. A. Cheng, J. Esparza, and J. Palsberg. Complexity result for 1-safe nets. TCS, 147:117–136, 1995.
5. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献