Verification of hybrid systems

L Doyen, G Frehse, GJ Pappas, A Platzer - Handbook of Model Checking, 2018 - Springer
Hybrid systems are models which combine discrete and continuous behavior. They occur
frequently in safety-critical applications in various domains such as health care …

Stochastic timed automata

N Bertrand, P Bouyer, T Brihaye… - Logical methods in …, 2014 - lmcs.episciences.org
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 …

Model checking of continuous-time Markov chains against timed automata specifications

T Chen, T Han, JP Katoen… - Logical Methods in …, 2011 - lmcs.episciences.org
We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear
real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller …

Quantitative model checking of continuous-time Markov chains against timed automata specifications

T Chen, T Han, JP Katoen… - 2009 24th Annual IEEE …, 2009 - ieeexplore.ieee.org
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a
linear real-time property provided as a deterministic timed automaton (DTA) A, what is the …

Efficient CTMC model checking of linear real-time objectives

B Barbot, T Chen, T Han, JP Katoen… - … Conference on Tools and …, 2011 - Springer
This paper makes verifying continuous-time Markov chains (CTMCs) against deterministic
timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done …

Defining fairness in reactive and concurrent systems

H Völzer, D Varacca - Journal of the ACM (JACM), 2012 - dl.acm.org
We define when a linear-time temporal property is a fairness property with respect to a given
system. This captures the essence shared by most fairness assumptions that are used in the …

Quantitative model-checking of one-clock timed automata under probabilistic semantics

N Bertrand, P Bouyer, T Brihaye… - 2008 Fifth International …, 2008 - ieeexplore.ieee.org
In a probabilistic semantics for timed automata has been defined in order to rule out unlikely
(sequences of) events. The qualitative model-checking problem for LTL properties has been …

Robust Analysis of Timed Automata Via Channel Machines

P Bouyer, N Markey, PA Reynier - … on Foundations of Software Science and …, 2008 - Springer
Whereas formal verification of timed systems has become a very active field of research, the
idealised mathematical semantics of timed automata cannot be faithfully implemented …

[PDF][PDF] Robustness in real-time systems.

N Markey - SIES, 2011 - people.irisa.fr
Robustness in Real-time Systems Page 1 Robustness in Real-time Systems Nicolas Markey
LSV – CNRS & ENS Cachan, France nicolas.markey@lsv.ens-cachan.fr Abstract We review …

Transient analysis of networks of stochastic timed automata using stochastic state classes

P Ballarini, N Bertrand, A Horváth, M Paolieri… - … Evaluation of Systems …, 2013 - Springer
Abstract Stochastic Timed Automata (STA) associate logical locations with continuous,
generally distributed sojourn times. In this paper, we introduce Networks of Stochastic Timed …