Abstract
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.
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.
Original language | English |
---|---|
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 253 |
Issue number | 3 |
Pages (from-to) | 25-31 |
Number of pages | 7 |
ISSN | 1571-0661 |
DOIs | |
Publication status | Published - Nov 2009 |
Event | Proceedings of 7th Workshop on Quantitative Aspects of Programming Languages, QAPL 2009 - Duration: 19 May 2010 → … |
Conference
Conference | Proceedings of 7th Workshop on Quantitative Aspects of Programming Languages, QAPL 2009 |
---|---|
Period | 19/05/2010 → … |