Discounting in Time

Uli Fahrenberg, Kim Guldstrand Larsen

Research output: Contribution to journalConference article in JournalResearchpeer-review

6 Citations (Scopus)

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.
Original languageEnglish
JournalElectronic Notes in Theoretical Computer Science
Volume253
Issue number3
Pages (from-to)25-31
Number of pages7
ISSN1571-0661
DOIs
Publication statusPublished - Nov 2009
EventProceedings of  7th Workshop on Quantitative Aspects of Programming Languages, QAPL 2009 -
Duration: 19 May 2010 → …

Conference

ConferenceProceedings of  7th Workshop on Quantitative Aspects of Programming Languages, QAPL 2009
Period19/05/2010 → …

Cite this