Real-time systems are notoriously hard to verify due to nondeterminism, concurrency and
timing constraints. When timing constants are uncertain (in early the design phase, or due to …

Parametric timed automata are a powerful formalism for reasoning on concurrent real-time
systems with unknown or uncertain timing constants. In order to test the efficiency of new …

Abstract Model-based mutation testing has the potential to effectively drive test generation to
reveal faults in software systems. However, it faces a typical efficiency issue since it could …

Monitoring of hybrid systems attracts both scientific and practical attention. However,
monitoring algorithms suffer from the methodological difficulty of only observing sampled …

Timed formalisms such as Timed Automata (TA), Signal Temporal Logic (STL) and Timed
Regular expressions (TRE) have been previously applied as behaviour specifications for …

Timed automata (TAs) are a widely used formalism to specify systems having temporal
requirements. However, exactly specifying the system may be difficult, as the user may not …

Given a log and a specification, timed pattern matching aims at exhibiting for which start and
end dates a specification holds on that log. For example,“a given action is always followed …

Monitoring consists in deciding whether a log meets a given specification. In this work, we
propose an automata-based formalism to monitor logs in the form of actions associated with …

Timed pattern matching has strong connections with monitoring real-time systems. Given a
log and a specification containing timing parameters (that can capture uncertain or unknown …

Monitoring the correctness of distributed cyber-physical systems is essential. We address
the analysis of the log of a black-box cyber-physical system. Detecting possible safety …