Publisher
Springer International Publishing
Reference17 articles.
1. Araki, T., Kasami, T.: Decidability problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci. 4, 99–119 (1977)
2. Esparza, J.: Petri nets, commutative grammars and basic parallel processes. Fundamenta Informaticae 30, 24–41 (1997)
3. Hauschildt, D.: Semilinearity of the Reachability Set is Decidable for Petri Nets. Technical report FBI-HH-B-146/90, University of Hamburg (1990)
4. Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)
5. Huynh, D.: Commutative grammars: the complexity of uniform word problems. Inf. Control 57, 21–39 (1983)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献