Theoretical Computer Science
Competitive Markov decision processes
Competitive Markov decision processes
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Discount-Optimal Infinite Runs in Priced Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
This paper deals with the issue of discounting in weighted timed transition systems. Discounting provides a way to model optimal-cost problems for infinite runs and has applications in optimal scheduling and other areas. We show that when postulating a certain natural additivity property for the discounted weights of runs, there is essentially only one possible way to introduce a discounting semantics. Our proof relies on the fact that a certain functional equation essentially only has one solution, for which we provide an elementary proof.