Reasoning about infinite computations
Information and Computation
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Skew and infinitary formal power series
Theoretical Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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.