Place-Boundedness for Vector Addition Systems with one zero-test - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Place-Boundedness for Vector Addition Systems with one zero-test

Résumé

Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a variation of the Karp-Miller algorithm to compute a basis of the downward closure of the reachability set which allows to decide place-boundedness. This forward algorithm is able to pass the zero-tests thanks to a finer cover, hybrid between the reachability and cover sets, reclaiming accuracy on one component. We show that this filtered cover is still recursive, but that equality of two such filtered covers, even for usual Vector Addition Systems (with no zero-test), is undecidable.
Fichier principal
Vignette du fichier
VASS0.pdf (208.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00948975 , version 1 (21-02-2014)

Identifiants

  • HAL Id : hal-00948975 , version 1

Citer

Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun. Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010, Dec 2010, India. pp.192--203. ⟨hal-00948975⟩
107 Consultations
67 Téléchargements

Partager

Gmail Facebook X LinkedIn More