50 search results - page 10 / 10 » Model Checking via Reachability Testing for Timed Automata |
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
CORR
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
ICSE
2001
IEEE-ACM
13 years 9 months ago
2001
IEEE-ACM
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
ASE
2005
13 years 5 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...