Games with bound guess actions
We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide numbers that need to satisfy some bounding constraints. These are natural extensions of domination games occurring in the regular cost function theory. In this paper we consider...
Saved in:
Published in | 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) pp. 1 - 10 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
ACM
01.07.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide numbers that need to satisfy some bounding constraints. These are natural extensions of domination games occurring in the regular cost function theory. In this paper we consider more specifically the case where the constraints to be bounded are regular cost functions, and the long term goal is an ω-regular winning condition. We show that such games are decidable on finite arenas. |
---|---|
AbstractList | We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide numbers that need to satisfy some bounding constraints. These are natural extensions of domination games occurring in the regular cost function theory. In this paper we consider more specifically the case where the constraints to be bounded are regular cost functions, and the long term goal is an ω-regular winning condition. We show that such games are decidable on finite arenas. |
Author | Goller, Stefan Colcombet, Thomas |
Author_xml | – sequence: 1 givenname: Thomas surname: Colcombet fullname: Colcombet, Thomas organization: Institut de Recherche en Informatique Fondamentale, CNRS, Université Paris Diderot – sequence: 2 givenname: Stefan surname: Goller fullname: Goller, Stefan organization: Laboratoire Spécification et Vérification, ENS de Cachan & CNRS |
BookMark | eNrjYmDJy89LZWTgtTS3MDQxNTA2MbY0NGNi4DQyNTfVNTU1suBg4C0uzjIwMDAyNLewNDDkZJBzT8xNLVYozyzJUEjKL81LUUgvTS0uVkhMLsnMzyvmYWBNS8wpTuWF0twM0m6uIc4eupmpqanxBUWZuYlFlfEWpuZmxpYGxvhlAVtcKvI |
ContentType | Conference Proceeding |
DBID | 6IE 6IH CBEJK ESBDL RIE RIO |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore Open Access Journals IEEE Xplore IEEE Proceedings Order Plans (POP) 1998-present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISBN | 9781450343916 1450343910 |
EISSN | 2575-5528 |
EndPage | 10 |
ExternalDocumentID | 8576390 |
Genre | orig-research |
GroupedDBID | --Z 23M 29P 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO ESBDL IEGSK IJVOP IPLJI JC5 M43 OCL RIE RIL RIO RNS |
ID | FETCH-ieee_primary_85763903 |
IEDL.DBID | RIE |
IngestDate | Wed Jun 26 19:28:22 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | true |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-ieee_primary_85763903 |
OpenAccessLink | https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/document/8576390 |
ParticipantIDs | ieee_primary_8576390 |
PublicationCentury | 2000 |
PublicationDate | 2016-July |
PublicationDateYYYYMMDD | 2016-07-01 |
PublicationDate_xml | – month: 07 year: 2016 text: 2016-July |
PublicationDecade | 2010 |
PublicationTitle | 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
PublicationTitleAbbrev | LICS |
PublicationYear | 2016 |
Publisher | ACM |
Publisher_xml | – name: ACM |
SSID | ssj0002178901 ssj0002640 |
Score | 4.0189223 |
Snippet | We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide numbers that need to satisfy some... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 1 |
SubjectTerms | Automata Cost function Games Reactive power Registers Task analysis |
Title | Games with bound guess actions |
URI | https://ieeexplore.ieee.org/document/8576390 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQAXa5zCwME010U0Cz7iZpxqm6iRZpqboWhobJKUmpSSYWKaDxDl8_M49QE68I0wgmBh34XpjU1FTw4rNUPRATPJefkp9cChoq07cANo6BfXRmBmYLAyPIXi34eAqwaW1hibS8A1jRG6DcmAKuMNwEGHxhVkHWiWTrlZYk6SVXoZ3CSKxbBBlEEVvzFALglY4QA1NqnjCDAOxuBgVoVhVhkHMHLX9VAA2zKiSBrk5SSAdWAMUKkH0MxaIM0m6uIc4euiAr4wsgR07EQ20zFmNgycvPS5VgACo3N0u1tEg0SUxJNUkyNwOdsm2RZpIMbIZaphqZWEgyiGAzQQq7sDQDF7AlYAZZhyrDwFJSVJoqC6xtS5LkwMEMAJ8uhek |
link.rule.ids | 310,311,786,790,795,796,802,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQAXa5zCwME010U0Cz7iZpxqm6iRZpqboWhobJKUmpSSYWKaDxDl8_M49QE68I0wgmBh34XpjU1FTw4rNUPRATPJefkp9cChoq07cANo6BfXRmBlZgPW9gDtmtBR9RATauLSyRFngAq3oDlDtTwFWGmwCDL8wyyEqRbL3SkiS95Cq0cxiJdY0ggyhic55CALzaEWJgSs0TZhCA3c6gAM2sIgxy7qAFsAqggVaFJNDlSQrpwCqgWAGyk6FYlEHazTXE2UMXZGV8AeTQiXiobcZiDCx5-XmpEgxA5eZmqZYWiSaJKakmSeZmoHO2LdJMkoENUctUIxMLSQYRbCZIYReWZ-D0CPH1iffx9POWZuACtgvMIKtSZRhYSopKU2WBdW9Jkhw4yAHdmok9 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2016+31st+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science+%28LICS%29&rft.atitle=Games+with+bound+guess+actions&rft.au=Colcombet%2C+Thomas&rft.au=Goller%2C+Stefan&rft.date=2016-07-01&rft.pub=ACM&rft.eissn=2575-5528&rft.spage=1&rft.epage=10&rft.externalDocID=8576390 |