524 search results - page 13 / 105 » Temporal reachability graphs |
STACS
1994
Springer
15 years 3 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
CSR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
APN
2004
Springer
15 years 5 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
CORR
2007
Springer
14 years 11 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...