321 search results - page 11 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ENTCS
2007
13 years 8 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 3 months ago
2009
IEEE
ICST
2010
IEEE
13 years 7 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 ...
CONCUR
1999
Springer
14 years 1 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...
SIGSOFT
2009
ACM
14 years 9 months ago
2009
ACM
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...