Filters








916 Hits in 5.4 sec

History Determinism vs. Good for Gameness in Quantitative Automata

Udi Boker, Karoliina Lehtinen, Mikołaj Bojańczyk, Chandra Chekuri
2021
While in the Boolean setting, history determinism and good for gameness coincide, we show that this is no longer the case in the quantitative setting: good for gameness is broader than history determinism  ...  We study three closely related such models - history determinism, good for gameness and determinisability by pruning - on quantitative automata.  ...  In the quantitative setting, [16, 17, 18 ] speak of good for games quantitative automata, although their definition is closer to history determinism.)  ... 
doi:10.4230/lipics.fsttcs.2021.38 fatcat:w42cmpvfqrd5fpfr3puyc6uigi

Verifying Quantitative Properties Using Bound Functions [chapter]

Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
2005 Lecture Notes in Computer Science  
In the case of open systems, these problems require the solution of games with integer values.  ...  In this framework, model checking can be used to compute, for example, the minimum battery capacity necessary for achieving a given objective, or the maximal achievable lifetime of a system with a given  ...  This research was supported in part by the ONR grant N00014-02-1-0671, the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202.  ... 
doi:10.1007/11560548_7 fatcat:7yikeing4fc4dpphorqa6ucwiy

Automata-based Quantitative Verification [article]

Suguman Bansal
2020 arXiv   pre-print
Existing solutions for problems in quantitative analysis face two challenges, namely lack of generalizability and separation-of-techniques.  ...  Separation-of-techniques refers to the inherent dichotomy in solving problems in quantitative analysis.  ...  To solve a reachability/safety game refers to determining whether there exists a winning strategy for player P 1 in the game.  ... 
arXiv:2010.02055v1 fatcat:jynqpn2msrdi5j72t3fm6yuiti

Cellular Automata and Randomization: A Structural Overview [chapter]

Monica Dascălu
2018 From Natural to Artificial Intelligence - Algorithms and Applications  
The chapter overviews the methods, algorithms, and architectures for random number generators based on cellular automata, as presented in the scientific literature.  ...  The variations in linear and two-dimensional cellular automata model and their features are discussed in relation to their applications as randomizers.  ...  Acknowledgements I want to thank the editor for the suggestions that very much helped to improve this chapter. Also, I would like to thank Eduard Franti for useful remarks and support.  ... 
doi:10.5772/intechopen.79812 fatcat:enrbvyep55fdnhjxsr23gsqhty

A generalized approach to belief learning in repeated games

Christos A. Ioannou, Julian Romero
2014 Games and Economic Behavior  
The methodology consists of (1) a generalized repeated-game strategy space, (2) a mapping between histories and repeated-game beliefs, and (3) asynchronous updating of repeated-game strategies.  ...  We propose a methodology that is generalizable to a broad class of repeated games in order to facilitate operability of belief learning models with repeated-game strategies.  ...  In Section 3, we provide details on the simulations and the goodness-of-fit measure used to compare quantitatively the predictions of the models with laboratory experimental data.  ... 
doi:10.1016/j.geb.2014.05.007 fatcat:ca63fgritfdp3ksj2ah6ymfjza

Evolutionary Dynamics of Regret Minimization [chapter]

Tomas Klos, Gerrit Jan van Ahee, Karl Tuyls
2010 Lecture Notes in Computer Science  
Recent work has considered the replicator dynamics of evolutionary game theory for this purpose. In this paper we contribute to this framework.  ...  derived dynamics of Q-learning and various Linear Reward algorithms in a set of benchmark normal form games.  ...  For this interaction, we again show plots for all games (Figures 6-8) . The interaction is now changed not just quantitatively, but qualitatively as well.  ... 
doi:10.1007/978-3-642-15883-4_6 fatcat:wvvf2avoivffbm6wp6cqqhezgi

Infinite-State Energy Games [article]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 arXiv   pre-print
We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata.  ...  Furthermore, we show that energy games and simulation games are inter-reducible, and thus we additionally obtain several new (un)decidability results for the problem of checking simulation preorder between  ...  The most commonly studied quantitative games are energy games and limit-average games (also called mean-payoff games), which differ in the quantitative winning condition.  ... 
arXiv:1405.0628v1 fatcat:4txedyql35drbjkxdbbqgduodq

Infinite-state energy games

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata.  ...  Furthermore, we show that energy games and simulation games are inter-reducible, and thus we additionally obtain several new (un)decidability results for the problem of checking simulation preorder between  ...  The most commonly studied quantitative games are energy games and limit-average games (also called mean-payoff games), which differ in the quantitative winning condition.  ... 
doi:10.1145/2603088.2603100 dblp:conf/csl/AbdullaAHMKT14 fatcat:s77fktljqnb5xj7oepjihinzia

Regular Decision Processes for Grid Worlds [article]

Nicky Lenaers, Martijn van Otterlo
2021 arXiv   pre-print
For many aspects however, ranging from constrained or safe specifications to various kinds of temporal (non-Markovian) dependencies in task and reward structures, extensions are needed.  ...  In particular, we provide a tool chain for regular decision processes, algorithmic extensions relating to online, incremental learning, an empirical evaluation of model-free and model-based solution algorithms  ...  In order to find a policy in absence of a model, one needs the state-action value for each action a ∈ A in state s ∈ S, denoted q(s, a), in order to determine the best policy.  ... 
arXiv:2111.03647v2 fatcat:4t67j442zjgfro6snsh2cgkjue

A Step Up in Expressiveness of Decidable Fixpoint Logics

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
Using automata, we show that the resulting logics have a decidable satisfiability problem, and provide a fine study of the complexity of satisfiability.  ...  Here we show that one of the main restrictions imposed in the past can be lifted, getting a richer decidable logic by allowing fixpoints in which the parameters of the fixpoint can be unguarded.  ...  A strategy for Eve is a function that given the history of the play and the current position in the game, determines Eve's choice in the game.  ... 
doi:10.1145/2933575.2933592 dblp:conf/lics/BenediktBB16 fatcat:iofilouplngydidnz42r5dkpt4

Beyond admissibility: Dominance between chains of strategies [article]

Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie Van den Bogaard
2018 arXiv   pre-print
However, in games played on finite graphs with quantitative objectives (as used for reactive synthesis), this is not the case.  ...  Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory.  ...  Pérez for several fruitful discussions.  ... 
arXiv:1805.11608v1 fatcat:y7xha2diynb7rn6mgy5ei5nylm

Synchronization and Control of Quantitative Systems [article]

Simon Laursen
2016 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
In this thesis, we explore modeling formalisms for quantitative systems and systems with partial observability to determine their computational limitations and feasibility.  ...  Formal methods, such as model checking, theorem proving and static analysis, are used to provide confidence in system models and designs, as it can assist in all phases of system development and testing  ...  We thank these institutions for their hospitality, and for the support by the DFG project TriCS (ZI 1516/1-1), the ERC Advanced Grant LASSO and the EU FET projects SENSATION and CASSTING.  ... 
doi:10.5278/vbn.phd.engsci.00182 fatcat:kftiafaw4fhf5lyrvqha7vaoce

Social Science Simulation — Origins, Prospects, Purposes [chapter]

Klaus G. Troitzsch
1997 Lecture notes in economics and mathematical systems  
This paper is about some history and some future development of computer simulation (Ostrom's Third Symbol System) in the social sciences, as opposed to mathematical modelling (Ostrom's Second Symbol System  ...  Concept driven simulation is defended, but data driven simulation is also pleaded for, taking into account that understanding a social process must precede its prediction.  ...  Purposes: Prediction vs.  ... 
doi:10.1007/978-3-662-03366-1_3 fatcat:a3ywcjzljnecdic2qgiay66wwa

Astrobiological Complexity with Probabilistic Cellular Automata

Branislav Vukotić, Milan M. Ćirković
2012 Origins of life and evolution of the biosphere  
We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling astrobiological history of the Milky Way and its Galactic Habitable Zone.  ...  Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion.  ...  Dick, and the late Robert Bradbury for their valuable input, kind support, and technical help. The Editor, Alan W.  ... 
doi:10.1007/s11084-012-9293-2 pmid:22832998 fatcat:3sq2txut5rhgjgpnsbognvhuqu

Mean-Payoff Pushdown Games [article]

Krishnendu Chatterjee, Yaron Velner
2016 arXiv   pre-print
While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied  ...  quantitative objective, namely, mean-payoff objectives.  ...  ; and (2) two-player finite-state games with quantitative objectives.  ... 
arXiv:1201.2829v3 fatcat:46sufj6durealjvbx3wvip5ngy
« Previous Showing results 1 — 15 out of 916 results