86 search results - page 2 / 18 » Timed Diagnostics for Reachability Properties |
HYBRID
2009
Springer
14 years 1 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-...
WIA
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
CADE
2012
Springer
11 years 8 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...
FSTTCS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...