585 search results - page 20 / 117 » Better Abstractions for Timed Automata |
IFM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...
119
Voted
FORTEST
2008
14 years 11 months ago
2008
Abstract. This chapter presents principles and techniques for model-based blackbox conformance testing of real-time systems using the UPPAAL model-checking tool-suite. The basis fo...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CONCUR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...