Acceleration for Petri Nets
暂无分享,去创建一个
[1] Ernst W. Mayr,et al. An algorithm for the general Petri net reachability problem , 1981, STOC '81.
[2] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.
[3] Jérôme Leroux. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants , 2009, LICS.
[4] Laurent Fribourg,et al. Petri Nets, Flat Languages and Linear Arithmetic , 2000, WFLP.
[5] Philippe Schnoebelen,et al. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[6] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..
[7] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .
[8] Grégoire Sutre,et al. Flat Counter Automata Almost Everywhere! , 2005, ATVA.
[9] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..
[10] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.
[11] Jérôme Leroux,et al. Presburger Vector Addition Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[12] Richard L. Tenney,et al. The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.
[13] Seymour Ginsburg,et al. BOUNDED REGULAR SETS , 1966 .