231 search results - page 5 / 47 » Concurrent Reachability Games |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
ICALP
2010
Springer
14 years 7 days ago
2010
Springer
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
CSL
2002
Springer
13 years 7 months ago
2002
Springer
d Abstract) Marcin Jurdzi
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
FOSSACS
2004
Springer
14 years 25 days ago
2004
Springer
We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplifie...