134 search results - page 3 / 27 » Model-Checking for Weighted Timed Automata |
ENTCS
2007
13 years 6 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
LICS
2009
IEEE
14 years 1 months ago
2009
IEEE
CONCUR
1999
Springer
13 years 11 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...
ICST
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
FOSSACS
2011
Springer
12 years 10 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...