A stochastic timed automaton is a purely stochastic process defined on a timed automaton,
in which both delays and discrete choices are made randomly. We study the almost-sure …

Stochastic timed automata are an expressive formal model for hard and soft real-time
systems. They support choices and delays that can be deterministic, nondeterministic or …

Abstract Stochastic Timed Automata (STA) associate logical locations with continuous,
generally distributed sojourn times. In this paper, we introduce Networks of Stochastic Timed …

A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of
decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows …

The formal methods approach to develop reliable and efficient safety-or performance-critical
systems is to construct mathematically precise models of such systems on which properties …

Cyber breaches have grown exponentially over the years, both in the number of incidents
and in damage. Examples of such damaging attacks are numerous, with WannaCry …

We marry continuous time Markov decision processes (CTMDPs) with stochastic timed
automata into a model with joint expressive power. This extension is very natural, as the two …

Several ways of assigning probabilities to runs of timed automata (TA) have been proposed
recently. When only the TA is given, a relevant question is to design a probability distribution …

The growing complexity of Cyber-Physical Systems increasingly challenges existing
methods and techniques. What is needed is a new generation of scalable tools for model …

Several ways of assigning probabilities to runs of timed automata (TA) have been proposed
recently. When only the TA is given, a relevant question is to design a probability distribution …