Optimal Strategies in Priced Timed Game Automata
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under...
Gespeichert in:
| Veröffentlicht in: | FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science 2004-01, p.148-160 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 160 |
|---|---|
| container_issue | |
| container_start_page | 148 |
| container_title | FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science |
| container_volume | |
| creator | Bouyer, Patricia Cassez, Franck Fleury, Emmanuel Larsen, Kim G. |
| description | Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy. |
| doi_str_mv | 10.1007/978-3-540-30538-5_13 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16398787</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16398787</sourcerecordid><originalsourceid>FETCH-LOGICAL-c279t-1d557e74321b7b33d748eeb8f9998a3c41127347612f8a6462528c01711cfe373</originalsourceid><addsrcrecordid>eNotkMtOwzAQRc1LopT-AYtsWBo8Hj-XVUULUqUiUdaW4zpVIEmrOCz4e5yWWcxI917NjA4hD8CegDH9bLWhSKVgFJlEQ6UDvCB3mJWToC7JBBQARRT26mxwwaRR12SSI5xaLfCWzFL6YrlAWinNhLDNcahb3xQfQ--HuK9jKuqueO_rEHfFtm5zX_k2FvOf4dD6wd-Tm8o3Kc7-55R8Ll-2i1e63qzeFvM1DVzbgcJOSh3zSQ6lLhF3WpgYS1NZa43HIAC4RqEV8Mp4JRSX3AQGGiBUETVOyeN579Gn4Juq912okzv2-dv-14FCa7QZc_ycS9nq9rF35eHwnRwwN4JzGZxDl2m4Eyc3gsM_WvlZEw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal Strategies in Priced Timed Game Automata</title><source>Springer Books</source><creator>Bouyer, Patricia ; Cassez, Franck ; Fleury, Emmanuel ; Larsen, Kim G.</creator><contributor>Mahajan, Meena ; Lodaya, Kamal</contributor><creatorcontrib>Bouyer, Patricia ; Cassez, Franck ; Fleury, Emmanuel ; Larsen, Kim G. ; Mahajan, Meena ; Lodaya, Kamal</creatorcontrib><description>Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540240586</identifier><identifier>ISBN: 9783540240587</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540305386</identifier><identifier>EISBN: 9783540305385</identifier><identifier>DOI: 10.1007/978-3-540-30538-5_13</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Goal State ; Optimal Control Problem ; Optimal Cost ; Optimal Strategy ; Schedule Problem ; Theoretical computing</subject><ispartof>FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004-01, p.148-160</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c279t-1d557e74321b7b33d748eeb8f9998a3c41127347612f8a6462528c01711cfe373</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30538-5_13$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30538-5_13$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16398787$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Mahajan, Meena</contributor><contributor>Lodaya, Kamal</contributor><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Cassez, Franck</creatorcontrib><creatorcontrib>Fleury, Emmanuel</creatorcontrib><creatorcontrib>Larsen, Kim G.</creatorcontrib><title>Optimal Strategies in Priced Timed Game Automata</title><title>FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science</title><description>Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Goal State</subject><subject>Optimal Control Problem</subject><subject>Optimal Cost</subject><subject>Optimal Strategy</subject><subject>Schedule Problem</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540240586</isbn><isbn>9783540240587</isbn><isbn>3540305386</isbn><isbn>9783540305385</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNotkMtOwzAQRc1LopT-AYtsWBo8Hj-XVUULUqUiUdaW4zpVIEmrOCz4e5yWWcxI917NjA4hD8CegDH9bLWhSKVgFJlEQ6UDvCB3mJWToC7JBBQARRT26mxwwaRR12SSI5xaLfCWzFL6YrlAWinNhLDNcahb3xQfQ--HuK9jKuqueO_rEHfFtm5zX_k2FvOf4dD6wd-Tm8o3Kc7-55R8Ll-2i1e63qzeFvM1DVzbgcJOSh3zSQ6lLhF3WpgYS1NZa43HIAC4RqEV8Mp4JRSX3AQGGiBUETVOyeN579Gn4Juq912okzv2-dv-14FCa7QZc_ycS9nq9rF35eHwnRwwN4JzGZxDl2m4Eyc3gsM_WvlZEw</recordid><startdate>20040101</startdate><enddate>20040101</enddate><creator>Bouyer, Patricia</creator><creator>Cassez, Franck</creator><creator>Fleury, Emmanuel</creator><creator>Larsen, Kim G.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>20040101</creationdate><title>Optimal Strategies in Priced Timed Game Automata</title><author>Bouyer, Patricia ; Cassez, Franck ; Fleury, Emmanuel ; Larsen, Kim G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c279t-1d557e74321b7b33d748eeb8f9998a3c41127347612f8a6462528c01711cfe373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Goal State</topic><topic>Optimal Control Problem</topic><topic>Optimal Cost</topic><topic>Optimal Strategy</topic><topic>Schedule Problem</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Cassez, Franck</creatorcontrib><creatorcontrib>Fleury, Emmanuel</creatorcontrib><creatorcontrib>Larsen, Kim G.</creatorcontrib><collection>Pascal-Francis</collection><jtitle>FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bouyer, Patricia</au><au>Cassez, Franck</au><au>Fleury, Emmanuel</au><au>Larsen, Kim G.</au><au>Mahajan, Meena</au><au>Lodaya, Kamal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Strategies in Priced Timed Game Automata</atitle><jtitle>FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science</jtitle><date>2004-01-01</date><risdate>2004</risdate><spage>148</spage><epage>160</epage><pages>148-160</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540240586</isbn><isbn>9783540240587</isbn><eisbn>3540305386</eisbn><eisbn>9783540305385</eisbn><abstract>Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30538-5_13</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004-01, p.148-160 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16398787 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Goal State Optimal Control Problem Optimal Cost Optimal Strategy Schedule Problem Theoretical computing |
| title | Optimal Strategies in Priced Timed Game Automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T03%3A50%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Strategies%20in%20Priced%20Timed%20Game%20Automata&rft.jtitle=FSTTCS%202004:%20Foundations%20of%20Software%20Technology%20and%20Theoretical%20Computer%20Science&rft.au=Bouyer,%20Patricia&rft.date=2004-01-01&rft.spage=148&rft.epage=160&rft.pages=148-160&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540240586&rft.isbn_list=9783540240587&rft_id=info:doi/10.1007/978-3-540-30538-5_13&rft_dat=%3Cpascalfrancis_sprin%3E16398787%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540305386&rft.eisbn_list=9783540305385&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |