Abstract
We introduce a weighted linear temporal logic over infinite words with weights and discounting parameters over ℝ max. We translate the formulas of a syntactically defined fragment of our logic to weighted Büchi automata with discounting. We prove that every ω-recognizable series with discounting is the image of a series definable by a formula of this syntactic fragment through a strict alphabetic epimorphism. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Mandrali, E. (2012). Weighted LTL with discounting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 353–360). https://doi.org/10.1007/978-3-642-31606-7_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
