Vector Addition Systems Reachability Problem (A Simpler Solution)

Abstract : The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Presburger inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce from this result that there exist checkable certificates of non-reachability in the Presburger arithmetic. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas. In another recent paper we provided the first proof of the VAS reachability problem that is not based on the KLMST decomposition. The proof is based on the notion of production relations that directly proves the existence of Presburger inductive invariants. In this paper we propose new intermediate results that dramatically simplify this last proof.
Type de document :
Communication dans un congrès
Andrei Voronkov. The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. Andrei Voronkov, 10, pp.214-228, 2012, EPiC Series
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00674970
Contributeur : Jérôme Leroux <>
Soumis le : dimanche 20 mai 2012 - 13:01:34
Dernière modification le : mardi 24 juillet 2012 - 11:03:41
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 08:29:33

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00674970, version 3

Collections

Citation

Jérôme Leroux. Vector Addition Systems Reachability Problem (A Simpler Solution). Andrei Voronkov. The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. Andrei Voronkov, 10, pp.214-228, 2012, EPiC Series. 〈hal-00674970v3〉

Partager

Métriques

Consultations de
la notice

838

Téléchargements du document

425