Weighted versus Probabilistic Logics

Paul Gastin 1 Benedikt Bollig 2
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
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 : While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO.
Type de document :
Communication dans un congrès
Diekert, Volker and Nowotka, Dirk. Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), 2009, Stuttgart, Germany, Germany. Springer, 5583, pp.18-38, 2009, 〈10.1007/978-3-642-02737-6_2〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00772679
Contributeur : Stefan Haar <>
Soumis le : jeudi 10 janvier 2013 - 23:09:32
Dernière modification le : jeudi 11 janvier 2018 - 06:23:37

Lien texte intégral

Identifiants

Collections

Citation

Paul Gastin, Benedikt Bollig. Weighted versus Probabilistic Logics. Diekert, Volker and Nowotka, Dirk. Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), 2009, Stuttgart, Germany, Germany. Springer, 5583, pp.18-38, 2009, 〈10.1007/978-3-642-02737-6_2〉. 〈hal-00772679〉

Partager

Métriques

Consultations de la notice

129