Weighted versus Probabilistic Logics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Weighted versus Probabilistic Logics


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.


Other [cs.OH]

Dates and versions

hal-00772679 , version 1 (10-01-2013)



Paul Gastin, Benedikt Bollig. Weighted versus Probabilistic Logics. Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), 2009, Stuttgart, Germany, Germany. pp.18-38, ⟨10.1007/978-3-642-02737-6_2⟩. ⟨hal-00772679⟩
76 View
0 Download



Gmail Facebook Twitter LinkedIn More