259 search results - page 7 / 52 » Bounded Model Checking for Timed Automata |
111
Voted
ICST
2010
IEEE
15 years 1 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 ...
99
Voted
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
132
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
141
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
123
click to vote
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...