On selective unboundedness of VASS

Journal of Computer and System Sciences

Volumn 79, Issue 5, 2013, Pages 689-713

  Demri, Stéphane ^a  

^a CNRS   (France)

Author keywords

Exponential space; Place boundedness problem; Regularity detection problem; Vector addition systems with states

Indexed keywords

VECTORS;

BOUNDEDNESS; DETECTION PROBLEMS; EXPONENTIAL SPACE; POLYNOMIAL SPACE; REVERSAL-BOUNDEDNESS; RUN LENGTH; UPPER BOUND; VECTOR ADDITION SYSTEMS;

VECTOR SPACES;

EID: 84875228275     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2013.01.014     Document Type: Article

References (54)

1. P. Abdulla, and B. Jonsson Verifying programs with unreliable channels Inform. and Comput. 127 2 1996 91 101
2. M.F. Atig, and P. Habermehl On Yen's path logic for Petri nets Internat. J. Found. Comput. Sci. 22 4 2011 783 799
3. M.F. Atig, and P. Habermehl On Yen's path logic for Petri nets RP'09 Lecture Notes in Comput. Sci. vol. 5797 2009 Springer 51 63
4. B. Baker, and R. Book Reversal-bounded multipushdown machines J. Comput. System Sci. 8 1974 315 332
5. M. Blockelet, and S. Schmitz Model-checking coverability graphs of vector addition systems MFCS'11 Lecture Notes in Comput. Sci. vol. 6907 2011 Springer 108 119
6. R. Bonnet Decidability of LTL model checking for vector addition systems with one zero-test RP'11 Lecture Notes in Comput. Sci. vol. 6945 2011 Springer 85 95
7. R. Bonnet The reachability problem for vector addition systems with one zero-test MFCS'11 Lecture Notes in Comput. Sci. vol. 6907 2011 Springer 145 157
8. I. Borosh, and L. Treybig Bounds on positive integral solutions of linear Diophantine equations Proc. Amer. Math. Soc. 55 1976 299 304
9. M. Bozga, R. Iosif, and F. Konecný Fast acceleration of ultimately periodic relations CAV'10 Lecture Notes in Comput. Sci. vol. 6174 2009 Springer 227 242
10. E. Cardoza, R.J. Lipton, A.R. Meyer, Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report, in: STOC'76, 1976, pp. 50-54.
11. H. Comon, and Y. Jurski Multiple counters automata, safety analysis and Presburger analysis CAV'98 Lecture Notes in Comput. Sci. vol. 1427 1998 Springer 268 279
12. Z. Dang, O. Ibarra, and P. San Pietro Liveness verification of reversal-bounded multicounter machines with a free counter FST&TCS'01 Lecture Notes in Comput. Sci. vol. 2245 2001 Springer 132 143
13. S. Demri On selective unboundedness of VASS Proceedings of the 12th International Workshop on Verification of Infinite State Systems (INFINITY'10) Electron. Proc. Theor. Comput. Sci. vol. 39 2010 1 15
14. S. Demri Slides on EXPSPACE-hard problems on VASS available on http://www.lsv.ens-cachan.fr/~demri/slides-mpri2010-lecture2.pdf September 2010
15. S. Demri, A.K. Dhar, and A. Sangnier Taming past LTL and flat counter systems IJCAR'12 Lecture Notes in Artificial Intelligence vol. 7364 2012 Springer 179 193
16. C. Dufourd, A. Finkel, and Ph. Schnoebelen Reset nets between decidability and undecidability ICALP'98 Lecture Notes in Comput. Sci. vol. 1443 1998 Springer 103 115
17. C. Dufourd, P. Jančar, and Ph. Schnoebelen Boundedness of reset P/T nets ICALP'99 Lecture Notes in Comput. Sci. vol. 1644 1999 Springer 301 310
18. J. Esparza Decidability and complexity of Petri net problems - An introduction Advances in Petri Nets 1998 Lecture Notes in Comput. Sci. vol. 1491 1998 Springer Berlin 374 428
19. A. Finkel Reduction and covering of infinite reachability trees Inform. and Comput. 89 2 1990 144 179
20. A. Finkel, and A. Sangnier Reversal-bounded counter machines revisited MFCS'08 Lecture Notes in Comput. Sci. vol. 5162 2008 Springer 323 334
21. A. Finkel, and A. Sangnier Mixing coverability and reachability to analyze VASS with one zero-test SOFSEM'10 Lecture Notes in Comput. Sci. vol. 5901 2010 Springer 394 406
22. A. Finkel, and Ph. Schnoebelen Well-structured transitions systems everywhere! Theoret. Comput. Sci. 256 1-2 2001 63 92
23. E. Gurari, O. Ibarra, An NP-complete number-theoretic problem, in: STOC'78, 1978, pp. 205-215.
24. P. Habermehl On the complexity of the linear-time mu-calculus for Petri nets ICATPN'97 Lecture Notes in Comput. Sci. vol. 1248 1997 Springer 102 116
25. D. Hauschildt, Semilinearity of the reachability set is decidable for Petri nets, PhD thesis, University of Hamburg, 1990.
26. J. Hopcroft, and J.J. Pansiot On the reachability problem for 5-dimensional vector addition systems Theoret. Comput. Sci. 8 1979 135 159
27. R. Howell, and L. Rosier An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines J. Comput. System Sci. 34 1 1987 55 74
28. O. Ibarra Reversal-bounded multicounter machines and their decision problems J. ACM 25 1 1978 116 133
29. O. Ibarra, J. Su, Z. Dang, T. Bultan, and R. Kemmerer Counter machines and verification problems Theoret. Comput. Sci. 289 1 2002 165 189
30. M. Jantzen Complexity of place/transition nets Advances in Petri Nets 1986 Lecture Notes in Comput. Sci. vol. 254 1987 Springer 413 434
31. R.M. Karp, and R.E. Miller Parallel program schemata J. Comput. System Sci. 3 2 1969 147 195
32. E. Kopczynski, and A. To Parikh images of grammars: complexity and applications LICS'10 2010 IEEE 80 89
33. R. Kosaraju, Decidability of reachability in vector addition systems, in: STOC'82, 1982, pp. 267-281.
34. J.L. Lambert A structure to decide reachability in Petri nets Theoret. Comput. Sci. 99 1992 79 104
35. J.L. Lambert, Vector addition systems and semi-linearity, manuscript, 1994.
36. J. Leroux, Vector addition system reachability problem (a short self-contained proof), in: POPL'11, 2011, pp. 307-316.
37. R.J. Lipton, The reachability problem requires exponential space, Technical Report 62, Department of Computer Science, Yale University, 1976.
38. E.W. Mayr An algorithm for the general Petri net reachability problem SIAM J. Comput. 13 3 1984 441 460
39. M. Minsky Computation, Finite and Infinite Machines 1967 Prentice Hall
40. R. Parikh On context-free languages J. ACM 13 4 1966 570 581
41. D. Perrin, and J.-E. Pin Infinite Words: Automata, Semigroups, Logic and Games 2004 Elsevier
42. M. Praveen Small vertex cover makes Petri net coverability and boundedness easier IPEC'10 Lecture Notes in Comput. Sci. vol. 6478 2010 Springer 216 227
43. M. Praveen, and K. Lodaya Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE FST&TCS'09 2009 LZI 347 358
44. M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in: Comptes Rendus du premier congrès de mathématiciens des Pays Slaves, Warszawa, 1929, pp. 92-101.
45. C. Rackoff The covering and boundedness problems for vector addition systems Theoret. Comput. Sci. 6 2 1978 223 231
46. W. Reisig, and G. Rozenberg Lectures on Petri Nets I: Basic Models Lecture Notes in Comput. Sci. vol. 1491 1998 Springer
47. C. Reutenauer The Mathematics of Petri Nets 1990 Masson and Prentice
48. L. Rosier, and H.-C. Yen A multiparameter analysis of the boundedness problem for vector addition systems J. Comput. System Sci. 32 1986 105 135
49. A. Sangnier, Vérification de systèmes avec compteurs et pointeurs, Thèse de doctorat, LSV, ENS Cachan, France, 2008.
50. W.J. Savitch Relationships between nondeterministic and deterministic tape complexities J. Comput. System Sci. 4 2 1970 177 192
51. R. Valk, and M. Jantzen The residue of vector sets with applications to decidability problems in Petri nets Acta Inform. 21 1985 643 674
52. R. Valk, and G. Vidal-Naquet Petri nets and regular languages J. Comput. System Sci. 23 1981 299 325
53. P. van Emde Boas Machine models and simulations Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity 1990 Elsevier 2 66
54. H.-C. Yen A unified approach for deciding the existence of certain net paths Inform. and Comput. 96 1992 119 137