148 search results - page 1 / 30 » Dealing with practical limitations of distributed timed mode... |
FMSD
2006
13 years 4 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
CONCUR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
FOSSACS
2011
Springer
12 years 8 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...