Filters








5,895 Hits in 1.2 sec

Probabilistic game automata

Anne Condon, Richard E. Ladner
1988 Journal of computer and system sciences (Print)  
We define a probabilistic game automaton, a general model of a two-person game.  ...  We prove a number of results about another special case, games against unknown nature, which is a generalization of games against nature.  ...  In Section 2 we give precise definitions of probabilistic game automata.  ... 
doi:10.1016/0022-0000(88)90038-4 fatcat:pi3cpfcgnnhfrkwyvrvwu4i3nm

Probabilistic game automata [chapter]

Anne Condon, Richard Ladner
1986 Lecture Notes in Computer Science  
We define a probabilistic game automaton, a general model of a two-person game.  ...  We prove a number of results about another special case, games against unknown nature, which is a generalization of games against nature.  ...  In Section 2 we give precise definitions of probabilistic game automata.  ... 
doi:10.1007/3-540-16486-3_95 fatcat:36xjbws6crbw7efpsf2kgbl7jm

Quantitative Games on Probabilistic Timed Automata [article]

Marta Kwiatkowska, Gethin Norman, Ashutosh Trivedi
2010 arXiv   pre-print
In this paper we consider quantitative games over probabilistic timed automata.  ...  Asarin and Maler initiated the study of quantitative games on (non-probabilistic) timed automata by synthesising controllers which optimise the time to reach a final state.  ...  In addition, the third author wishes to thank Vojtěch Forejt for some stimulating discussions on this class of games.  ... 
arXiv:1001.1933v2 fatcat:s7ywpmla4ff6xkofjhm3dwh5qa

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata [article]

Vojtěch Forejt, Petr Jančar, Stefan Kiefer, James Worrell
2018 arXiv   pre-print
In the cases of probabilistic one-counter automata (pOCA), of probabilistic visibly pushdown automata (pvPDA), and of probabilistic basic process algebras (i.e., single-state pPDA) we show that an implicit  ...  We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking bisimilarity of probabilistic labelled transition systems to checking  ...  In this paper we are concerned with probabilistic pushdown automata (pPDA), that is, pushdown automata with both non-deterministic and probabilistic branching.  ... 
arXiv:1711.06120v2 fatcat:zdwipkqfhfhwtborane4glghnq

Percolation games, probabilistic cellular automata, and the hard-core model [article]

Alexander E. Holroyd, Irène Marcovici, James B. Martin
2018 arXiv   pre-print
This is equivalent to the question of ergodicity of a certain family of elementary one-dimensional probabilistic cellular automata (PCA).  ...  A player who moves the token to a trap loses the game immediately, while a player who moves the token to a target wins the game immediately.  ...  Percolation games and probabilistic cellular automata 2.1. The PCA for the percolation game. Consider the percolation game on Z 2 as defined in the introduction. Suppose x is an open site of Z 2 .  ... 
arXiv:1503.05614v3 fatcat:iome6qbpbnh55ljzke7iberw2m

Probabilistic Cellular Automata for Granular Media in Video Games [article]

Jonathan Devlin, Micah D. Schuster
2020 arXiv   pre-print
In video games, simulating these materials increases immersion and can be used for various game mechanics.  ...  Each update occurs using a set of probabilistic transitions that can be tuned to simulate friction between particles.  ...  This work looks to simulate physical phenomena in a realistic manner using cellular automata (CA), as done in games such as Noita [1] , Rimworld [2] , and Oxygen Not Included [3] .  ... 
arXiv:2008.06341v1 fatcat:nzuyrmxbuzcgbpqw3i56tko734

Stochastic Games for Verification of Probabilistic Timed Automata [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2009 Lecture Notes in Computer Science  
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour.  ...  For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently.  ...  Probabilistic timed automata (PTAs) [10, 2, 17] , which are finite state automata extended with real-valued clocks and discrete probabilistic choice, are a natural formalism for modelling and analysing  ... 
doi:10.1007/978-3-642-04368-0_17 fatcat:cemxdqklufeknnve2x2rdarnvy

Parameter synthesis for probabilistic timed automata using stochastic game abstractions

Aleksandra Jovanović, Marta Kwiatkowska
2018 Theoretical Computer Science  
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised  ...  To ensure precise reachability probabilities, we adapt the game-based abstraction refinement method.  ...  In this paper, we are dealing with the synthesis of timing parameters for probabilistic real-time systems modelled as probabilistic timed automata (PTA) [18] .  ... 
doi:10.1016/j.tcs.2017.05.005 fatcat:a6wbugvjxnaupijcndpsipr644

Are Good-for-Games Automata Good for Probabilistic Model Checking? [chapter]

Joachim Klein, David Müller, Christel Baier, Sascha Klüppelholz
2014 Lecture Notes in Computer Science  
One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata  ...  Second, we show how good-for-games automata can be used for the quantitative analysis of systems modeled by Markov decision processes against ω-regular specifications and evaluate this new method by a  ...  Good-for-games (GFG) automata. The formal definition of GFG automata [13] relies on a game-based view of ω-automata.  ... 
doi:10.1007/978-3-319-04921-2_37 fatcat:ahxnyvpdhzb4pdq4d3dqyqkbai

Percolation games, probabilistic cellular automata, and the hard-core model

Alexander E. Holroyd, Irène Marcovici, James B. Martin
2018 Probability theory and related fields  
then the player to move loses the game.  ...  This is equivalent to the question of ergodicity of a certain elementary one-dimensional probabilistic cellular automaton (PCA), which has been studied in the contexts of enumeration of directed animals  ...  Percolation games and probabilistic cellular automata 2.1. The PCA for the percolation game. Consider the percolation game on Z 2 as defined in the introduction. Suppose x is an open site of Z 2 .  ... 
doi:10.1007/s00440-018-0881-6 fatcat:4syaq7yvjndttnijldox6qdz6e

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions [chapter]

Aleksandra Jovanović, Marta Kwiatkowska
2014 Lecture Notes in Computer Science  
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised  ...  To ensure precise reachability probabilities, we adapt the game-based abstraction refinement method.  ...  In this paper, we are dealing with the synthesis of timing parameters for probabilistic real-time systems modelled as probabilistic timed automata (PTA) [18] .  ... 
doi:10.1007/978-3-319-11439-2_14 fatcat:jgffahmybjaxpognc2j2fzqgiu

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata [chapter]

Franck van Breugel, James Worrell
2014 Lecture Notes in Computer Science  
This provides a game theoretic characterization of the bisimilarity pseudometric and also of probabilistic bisimilarity.  ...  Pseudometric on Probabilistic Automata / 22 Franck van Breugel Bisimilarity Pseudometric on Probabilistic Automata / 22 Franck van Breugel Bisimilarity Pseudometric on Probabilistic Automata  ... 
doi:10.1007/978-3-319-06880-0_10 fatcat:sz6pjpiburg6hhbdbjj2lav7uu

A survey of partial-observation stochastic parity games

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
2012 Formal methods in system design  
automata.  ...  The one-sided partialobservation games have two important subclasses: the one-player games, known as partialobservation Markov decision processes (POMDPs), and the blind one-player games, known as probabilistic  ...  in probabilistic automata.  ... 
doi:10.1007/s10703-012-0164-2 fatcat:6ptph6d4qzcm3hiqzaeik4r3pm

Alternating Tree Automata with Qualitative Semantics [article]

Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
2020 arXiv   pre-print
with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.  ...  Instead, we directly construct an emptiness game making use of imperfect information.  ...  ] , alternating [17] , and probabilistic automata [8] .  ... 
arXiv:2002.03664v2 fatcat:cq5cdku5rbd5thg6e42wkhgycu

GIST: A Solver for Probabilistic Games [article]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Arjun Radhakrishna
2010 arXiv   pre-print
Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing  ...  Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable  ...  The tool also includes interfaces for building automata and games graphically.  ... 
arXiv:1004.2367v1 fatcat:2typwnm52fairfz7v2qmn5zhgq
« Previous Showing results 1 — 15 out of 5,895 results