Communication Dans Un Congrès Année : 2016

On the Complexity of Resource-Bounded Logics

Résumé

We revisit decidability results for resource-bounded logics and use decision problems for vector addition systems with states (VASS) to characterise the complexity of (decidable) model-checking problems. We show that the model-checking problem for the logic RB±ATL is 2exptime-complete by using recent results on alternating VASS. In addition, we establish that the model-checking problem for RBTL is decidable and has the same complexity as for RBTL∗ (the extension of RBTL with arbitrary path formulae), namely expspace-complete, proving a new decidability result as a by-product of the approach. Finally, we establish that the model-checking problem for RB±ATL∗ is decidable by a reduction to parity games, and show how to synthesise values for resource parameters.

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

Dates et versions

hal-03202652 , version 1 (20-04-2021)

Licence

Identifiants

Citer

Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan. On the Complexity of Resource-Bounded Logics. 10th International Workshop Reachability Problems, Kim Guldstrand Larsen; Igor Potapov; Jiří Srba, Sep 2016, Aalborg, Denmark. pp.36-50, ⟨10.1007/978-3-319-45994-3_3⟩. ⟨hal-03202652⟩
90 Consultations
169 Téléchargements

Altmetric

Partager

  • More