Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference16 articles.
1. Araki, T., Kasami, T.: Decidable problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci 4, 99?119 (1977)
2. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413?422 (1913)
3. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific J. Math. 16, 285?296 (1966)
4. Hack, M.: Decision problems for Petri nets and vector addition systems. M.I.T., Project MAC, MAC-TM 59 (1975)
5. Hack, M.: Decidability questions for Petri nets. M.I.T., LCS, TR 161 (1976)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献