This paper contributes to the multi-core model checking of timed automata (TA) with respect
to liveness properties, by investigating checking of TA Büchi emptiness under the very …

This work discusses a computational approach to reachability analysis of Max-Plus-Linear
(MPL) systems, a class of discrete-event systems widely used in synchronization and …

We present algorithms and techniques for the repair of timed system models, given as
networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic …

Abstract Model checking of timed automata is a widely used technique. But in order to take
advantage of modern hardware, the algorithms need to be parallelized. We present a multi …

We present TarTar, an automatic repair analysis tool that, given a timed diagnostic trace
(TDT) obtained during the model checking of a timed automaton model, suggests possible …

The paper presents a novel algorithm for computing worst case execution time (WCET) or
maximum termination time of real-time systems using the timed automata (TA) model …

Symbolic data structures for model checking timed systems have been subject to a
significant research, with Difference Bound Matrices (DBMs) still being the preferred data …

This paper presents an adaptation of the CEGAR loop approach based on the reduction of
the number of clocks in timed automata. In the presented method, an abstraction of the timed …

We present algorithms and techniques for the repair of timed system models, given as
networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic …

Voting procedures are of utmost importance for society and are widely believed to be the
foundation of democracy. They appear in different forms, in various scenarios, and often …