Non-Elementary Complexities for Branching VASS, MELL, and Extensions

Ranko Lazić 1 Sylvain Schmitz 2, 3, *
* Auteur correspondant
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential fragment is Tower-hard already in the affine case—and hence non-elementary. We match this lower bound for the full propositional affine linear logic, proving its Tower-completeness. We also show that provability in propositional contractive linear logic is Ackermann-complete.
Type de document :
Communication dans un congrès
Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. ACM, pp.61:1--61:1, 2014, 〈10.1145/2603088.2603129〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01076694
Contributeur : Sylvain Schmitz <>
Soumis le : mercredi 22 octobre 2014 - 18:46:59
Dernière modification le : jeudi 11 janvier 2018 - 06:22:14

Lien texte intégral

Identifiants

Collections

Citation

Ranko Lazić, Sylvain Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. ACM, pp.61:1--61:1, 2014, 〈10.1145/2603088.2603129〉. 〈hal-01076694〉

Partager

Métriques

Consultations de la notice

195