A translation of weighted LTL formulas to weighted Büchi automata over ω-valuation monoids

In this paper we introduce a weighted LTL over product $\omega$-valuation monoids that satisfy specific properties. We also introduce weighted generalized B\"uchi automata with $\varepsilon$-transitions, as well as weighted B\"uchi automata with $\varepsilon$-transitions over product $\omega$-valuation monoids and prove that these two models are expressively equivalent and also equivalent to weighted B\"uchi automata already introduced in the literature. We prove that every formula of a syntactic fragment of our logic can be effectively translated to a weighted generalized B\"uchi automaton with $\varepsilon$-transitions. We prove that the number of states of the produced automaton is polynomial in the size of the corresponding formula. For restricted product $\omega$-valuation monoids we define a weighted LTL, weighted generalized B\"uchi automata with $\varepsilon$-transitions, and weighted B\"uchi automata with $\varepsilon$-transitions, and we prove the aforementioned results for restricted product $\omega$-valuation monoids as well. The translation of weighted LTL formulas to weighted generalized B\"uchi automata with $\varepsilon$-transitions is now obtained for a restricted syntactical fragment of the logic.