149 search results - page 7 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
CODES
2008
IEEE
13 years 10 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
QEST
2010
IEEE
13 years 6 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
FORMATS
2007
Springer
14 years 2 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
FUIN
2008
13 years 8 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...