4 search results - page 1 / 1 » Reachability in Restricted Walk on Integers |
JUCS
2010
13 years 2 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
CADE
2012
Springer
11 years 6 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
APN
2003
Springer
13 years 9 months ago
2003
Springer
Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...