259 search results - page 8 / 52 » Bounded Model Checking for Timed Automata |
181
click to vote
FOSSACS
2011
Springer
14 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...
155
click to vote
ICTAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
151
click to vote
ATVA
2005
Springer
15 years 10 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 ...
178
click to vote
CODES
2008
IEEE
15 years 7 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...
163
Voted
QEST
2010
IEEE
15 years 3 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...