Discounting the Future in Systems Theory

Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 < a < 1. Discounting (or inflation) is a key paradigm in economics and has bee...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: de Alfaro, Luca, Henzinger, Thomas A., Majumdar, Rupak
Format: Buchkapitel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1037
container_issue
container_start_page 1022
container_title
container_volume 2719
creator de Alfaro, Luca
Henzinger, Thomas A.
Majumdar, Rupak
description Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 < a < 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision.
doi_str_mv 10.1007/3-540-45061-0_79
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15551647</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3073280_86_1040</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-7fc0e28a43bdad446bd9a7d237780ca94aaaa4560ef143b5448af2e1c100f0543</originalsourceid><addsrcrecordid>eNotULtOwzAUNU8RSnfGLEgsLtfxdRyPqFBAqsRAmS3XddpAmxTbGfr3uI-zXOm8pHsIuWcwYgDyiVOBQFFAyShoqc7ILU_MgYBzkrGSMco5qgsyVLI6aICK4yXJgENBlUR-TTIlKlGgYMUNGYbwAwm8YMmYkceXJtiub2PTLvO4cvmkj713edPmX7sQ3Sbks5Xr_O6OXNVmHdzwdAfke_I6G7_T6efbx_h5Si1nZaSytuCKyiCfL8wCsZwvlJGLgktZgTUKTQKKElzNkkcgVqYuHLPp4RoE8gF5OPZuTbBmXXvT2iborW82xu80E0KwEmXyjY6-kKR26byed91v0Az0fjvNdVpDH6bS--1SAE_FvvvrXYja7RPWtdGbtV2ZbXQ-aA6SFxXoqkw9CPwfMm1qsw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3073280_86_1040</pqid></control><display><type>book_chapter</type><title>Discounting the Future in Systems Theory</title><source>Springer Books</source><creator>de Alfaro, Luca ; Henzinger, Thomas A. ; Majumdar, Rupak</creator><contributor>Woeginger, Gerhard J ; Baeten, Jos C.M ; Parrow, Joachim ; Lenstra, Jan Karel ; Baeten, Jos C. M. ; Lenstra, Jan Karel ; Parrow, Joachim ; Woeginger, Gerhard J.</contributor><creatorcontrib>de Alfaro, Luca ; Henzinger, Thomas A. ; Majumdar, Rupak ; Woeginger, Gerhard J ; Baeten, Jos C.M ; Parrow, Joachim ; Lenstra, Jan Karel ; Baeten, Jos C. M. ; Lenstra, Jan Karel ; Parrow, Joachim ; Woeginger, Gerhard J.</creatorcontrib><description>Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 &lt; a &lt; 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540404934</identifier><identifier>ISBN: 3540404937</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540450610</identifier><identifier>EISBN: 9783540450610</identifier><identifier>DOI: 10.1007/3-540-45061-0_79</identifier><identifier>OCLC: 958524512</identifier><identifier>LCCallNum: QA76.758</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Automata, Languages and Programming, 2003, Vol.2719, p.1022-1037</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-7fc0e28a43bdad446bd9a7d237780ca94aaaa4560ef143b5448af2e1c100f0543</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3073280-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45061-0_79$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45061-0_79$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=15551647$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Woeginger, Gerhard J</contributor><contributor>Baeten, Jos C.M</contributor><contributor>Parrow, Joachim</contributor><contributor>Lenstra, Jan Karel</contributor><contributor>Baeten, Jos C. M.</contributor><contributor>Lenstra, Jan Karel</contributor><contributor>Parrow, Joachim</contributor><contributor>Woeginger, Gerhard J.</contributor><creatorcontrib>de Alfaro, Luca</creatorcontrib><creatorcontrib>Henzinger, Thomas A.</creatorcontrib><creatorcontrib>Majumdar, Rupak</creatorcontrib><title>Discounting the Future in Systems Theory</title><title>Automata, Languages and Programming</title><description>Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 &lt; a &lt; 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540404934</isbn><isbn>3540404937</isbn><isbn>3540450610</isbn><isbn>9783540450610</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNotULtOwzAUNU8RSnfGLEgsLtfxdRyPqFBAqsRAmS3XddpAmxTbGfr3uI-zXOm8pHsIuWcwYgDyiVOBQFFAyShoqc7ILU_MgYBzkrGSMco5qgsyVLI6aICK4yXJgENBlUR-TTIlKlGgYMUNGYbwAwm8YMmYkceXJtiub2PTLvO4cvmkj713edPmX7sQ3Sbks5Xr_O6OXNVmHdzwdAfke_I6G7_T6efbx_h5Si1nZaSytuCKyiCfL8wCsZwvlJGLgktZgTUKTQKKElzNkkcgVqYuHLPp4RoE8gF5OPZuTbBmXXvT2iborW82xu80E0KwEmXyjY6-kKR26byed91v0Az0fjvNdVpDH6bS--1SAE_FvvvrXYja7RPWtdGbtV2ZbXQ-aA6SFxXoqkw9CPwfMm1qsw</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>de Alfaro, Luca</creator><creator>Henzinger, Thomas A.</creator><creator>Majumdar, Rupak</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Discounting the Future in Systems Theory</title><author>de Alfaro, Luca ; Henzinger, Thomas A. ; Majumdar, Rupak</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-7fc0e28a43bdad446bd9a7d237780ca94aaaa4560ef143b5448af2e1c100f0543</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>de Alfaro, Luca</creatorcontrib><creatorcontrib>Henzinger, Thomas A.</creatorcontrib><creatorcontrib>Majumdar, Rupak</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>de Alfaro, Luca</au><au>Henzinger, Thomas A.</au><au>Majumdar, Rupak</au><au>Woeginger, Gerhard J</au><au>Baeten, Jos C.M</au><au>Parrow, Joachim</au><au>Lenstra, Jan Karel</au><au>Baeten, Jos C. M.</au><au>Lenstra, Jan Karel</au><au>Parrow, Joachim</au><au>Woeginger, Gerhard J.</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Discounting the Future in Systems Theory</atitle><btitle>Automata, Languages and Programming</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><volume>2719</volume><spage>1022</spage><epage>1037</epage><pages>1022-1037</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540404934</isbn><isbn>3540404937</isbn><eisbn>3540450610</eisbn><eisbn>9783540450610</eisbn><abstract>Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 &lt; a &lt; 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45061-0_79</doi><oclcid>958524512</oclcid><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Automata, Languages and Programming, 2003, Vol.2719, p.1022-1037
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_15551647
source Springer Books
subjects Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
title Discounting the Future in Systems Theory
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T17%3A26%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Discounting%20the%20Future%20in%20Systems%20Theory&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=de%20Alfaro,%20Luca&rft.date=2003&rft.volume=2719&rft.spage=1022&rft.epage=1037&rft.pages=1022-1037&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540404934&rft.isbn_list=3540404937&rft_id=info:doi/10.1007/3-540-45061-0_79&rft_dat=%3Cproquest_pasca%3EEBC3073280_86_1040%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540450610&rft.eisbn_list=9783540450610&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3073280_86_1040&rft_id=info:pmid/&rfr_iscdi=true