A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness

Résumé

We introduce a logic for specifying trace properties of vector addition systems (VAS). This logic can express linear relations among pumping segments occurring in a trace. Given a VAS and a formula in the logic, we investigate the question whether the VAS contains a trace satisfying the formula. Our main contribution is an exponential space upper bound for this problem. The proof is based on a small model property for the logic. Compared to similar logics that are solvable in exponential space, a distinguishing feature of our logic is its ability to express non-context-freeness of the trace language of a VAS. This allows us to show that the context-freeness problem for VAS, whose complexity was not established so far, is ExpSpace-complete.
Fichier principal
Vignette du fichier
cfexpspace-full.pdf (432.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00851915 , version 1 (22-08-2013)

Identifiants

Citer

Jérôme Leroux, M. Praveen, Grégoire Sutre. A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013 - 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.137-151, ⟨10.1007/978-3-642-40184-8_11⟩. ⟨hal-00851915⟩

Collections

CNRS ANR
276 Consultations
296 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More