Recently, a methodology for worst-case analysis of systems with discrete observable signals
has bee” proposed [4]. We extend this methodology to make use of conditional system …

We propose a methodology for worst-case analysis of systems with discrete observable
signals. The methodology can be used to verify different properties of systems such as …

Recently, a methodology for worst-case analysis of discrete systems has been proposed [1,
2]. The methodology relies on a user-provided abstraction of system components. In this …

STARS (STatic Analysis of Reactive Systems) is a methodology for worst-case analysis of
discrete systems. Theoretical foundations of STARS have been laid down [1, 2, 3], but no …

Predicate abstraction provides a powerful tool for verifying properties of infinite-state
systems using a combination of a decision procedure for a subset of first-order logic and …

We propose a performance verification technique for cyber-physical systems that consist of
multiple control loops implemented on a distributed architecture. The architectures we …

Symbolic model checking is a technique for verifying finite-state concurrent systems. Models
with up to 1030 states can often be verified in minutes. In this paper, we present a new tool …

We present sufficient conditions for the correctness of speed-independent circuits with
respect to their state graph (SG) specification, which can be tested in linear-time with respect …

Hard real-time systems need methods to determine upper bounds for their execution times,
usually called worst-case execution times. This paper explains the principles of our Timing …

Various techniques have been proposed to determine the worst case execution time of real--
time systems. For most of these approaches, it is not necessary to capture the complete …