Communication Dans Un Congrès Année : 2025

Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS

Résumé

We investigate the decidability/complexity status of the model-checking problem for an ability-based logic expressing knowing how assertions and enriched with budget constraints. To do so, we introduce a new control-state reachability problem for complete vector addition systems with states where the transitions are labelled by letters from a finite alphabet. It is required that all runs labelled by a given word lead synchronously to the target control states. First, we show that the model-checking problem involving knowing how can be reduced to the new problem on VASS. Second, we establish Ack-completeness of both problems by properly adapting or using developments about well-structured transition systems, belief functions and length function theorems.

Fichier principal
Vignette du fichier
final-rp25.pdf (623.44 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05287120 , version 1 (28-09-2025)

Licence

Identifiants

  • HAL Id : hal-05287120 , version 1

Citer

Stéphane Demri, Laurent Doyen, Raul Fervari. Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS. 19th International Conference on Reachability Problems, Oct 2025, Madrid, Spain. ⟨hal-05287120⟩
611 Consultations
231 Téléchargements

Partager

  • More