Results 1  10
of
136,391
Concurrent Reachability Games
, 2008
"... We consider concurrent twoplayer games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states; the objecti ..."
Abstract

Cited by 69 (22 self)
 Add to MetaCart
We consider concurrent twoplayer games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states
Concurrent Reachability Games
"... An open system can be modeled as a twoplayer game between the system and its environment. At each round of the game, player 1 (the system) and player 2 (the environment) independently and simultaneously choose moves, and the two choices determine the next state of the game. Properties of open syste ..."
Abstract
 Add to MetaCart
systems can be modeled as objectives of these twoplayer games. For the basic objective of reachability —can player 1 force the game to a given set of target states? — there are three types of winning states, according to the degree of certainty with which player 1 can reach the target. From type1 states
Strategy Improvement for Concurrent Reachability Games
, 2006
"... A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target st ..."
Abstract
 Add to MetaCart
A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target
Strategy improvement for concurrent reachability games
 In Proceedings of the Third Annual Conference on Quantitative Evaluation of Systems. IEEE Computer
, 2006
"... A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target state ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target
Winning concurrent reachability games requires doublyexponential patience
"... We exhibit a deterministic concurrent reachability game PURGATORYn with n nonterminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given ɛ < 1/2 must use nonzero behavior probabilities that a ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
We exhibit a deterministic concurrent reachability game PURGATORYn with n nonterminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given ɛ < 1/2 must use nonzero behavior probabilities
Monomial strategies for concurrent reachability games and other stochastic games?
"... Abstract. We consider twoplayer zerosum finite (but infinitehorizon) stochastic games with limiting average payoffs. We define a family of stationary strategies for Player I parameterized by ε> 0 to be monomial, if for each state k and each action j of Player I in state k except possibly one ..."
Abstract
 Add to MetaCart
corollary is that all concurrent reachability games have a monomial family of εoptimal strategies. This generalizes a classical result of de Alfaro, Henzinger and Kupferman who showed that this is the case for concurrent reachability games where all states have value 0 or 1. 1
unknown title
"... Approximating the value of a concurrent reachability game in the polynomial time hierarchy? ..."
Abstract
 Add to MetaCart
Approximating the value of a concurrent reachability game in the polynomial time hierarchy?
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Results 1  10
of
136,391