Model checking coverability graphs of vector addition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6907 LNCS, Issue , 2011, Pages 108-119

  Blockelet, Michel ^a   Schmitz, Sylvain ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Complexity; Coverability Properties; CTL; Vector Addition Systems

Indexed keywords

BOUNDEDNESS; COMPLEXITY; COMPUTATION TREE LOGIC; COVERABILITY; COVERABILITY GRAPHS; CTL; MODEL CHECKING PROBLEM; UPPER BOUND; VECTOR ADDITION; VECTOR ADDITION SYSTEMS;

COMPUTATION THEORY; VECTOR SPACES; VECTORS;

MODEL CHECKING;

EID: 80052134290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_13     Document Type: Conference Paper

References (22)

1. Atig, M.F., Habermehl, P.: On Yen's path logic for Petri nets. Int. J. Fund. Comput. Sci. 22(4), 783-799 (2011)
2. Axelsson, R., Hague, M., Kreutzer, S., Lange, M., Latte, M.: Extended computation tree logic. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 67-81. Springer, Heidelberg (2010)
3. Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups. In: STOC 1976, pp. 50-54. ACM Press, New York (1976)
4. Chambart, P., Finkel, A., Schmitz, S.: Forward analysis and model checking for trace bounded WSTS. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 49-68. Springer, Heidelberg (2011)
5. Demri, S.: On selective unboundedness of VASS. INFINITY 2010. Elec. Proc. In: Elec. Proc. in Theor. Comput. Sci., vol. 39, pp. 1-15 (2010)
6. Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Inf. 34(2), 85-107 (1997)
7. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson's Lemma. LICS 2011. IEEE, Los Alamitos (2011)
8. Finkel, A., Sangnier, A.: Reversal-bounded counter machines revisited. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 323-334. Springer, Heidelberg (2008)
9. Ganty, P., Majumdar, R., Rybalchenko, A.: Verifying liveness for asynchronous programs. In: POPL 2009, pp. 102-113. ACM Press, New York (2009)
10. Habermehl, P.: On the complexity of the linear-time μ-calculus for Petri nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 102-116. Springer, Heidelberg (1997)
11. Hack, M.: Decision problems for Petri nets and vector addition systems. Computation Structures Group Memo 95, Project MAC. MIT, Cambridge (1974)
12. Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135-159 (1979)
13. Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 645-659. Springer, Heidelberg (2010)
14. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
15. Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: STOC 1982, pp. 267-281. ACM Press, New York (1982)
16. Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: POPL 2011, pp. 307-316. ACM Press, New York (2011)
17. Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC 1981, pp. 238-246. ACM Press, New York (1981)
18. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6(2), 223-231 (1978)
19. Rosier, L.E., Yen, H.C.: A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. Syst. Sci. 32(1), 105-135 (1986)
20. Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. J. Comput. Syst. Sci. 23(3), 299-325 (1981)
21. Weispfenning, V.: The complexity of almost linear Diophantine problems. J. Symb. Comput. 10(5), 395-403 (1990)
22. Yen, H.C.: A unified approach for deciding the existence of certain Petri net paths. Inform. and Comput. 96(1), 119-137 (1992)