134 search results - page 3 / 27 » Model-Checking for Weighted Timed Automata |
126
click to vote
ENTCS
2007
15 years 6 days 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...
104
Voted
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
131
Voted
CONCUR
1999
Springer
15 years 4 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...
93
Voted
ICST
2010
IEEE
14 years 10 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 ...
126
Voted
FOSSACS
2011
Springer
14 years 3 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...