Symbolic models for randomly switched stochastic systems

In the past few years, there has been a growing interest in the use of symbolic models for control systems, however this has only recently covered the class of continuous-time stochastic hybrid systems. The main reason for this interest is the possibility to use algorithmic techniques over symbolic models to synthesize hybrid controllers enforcing logic specifications on the original models, which would be hard (or even impossible) to enforce with classical control techniques. Examples of such specifications include those expressible via linear temporal logic or as automata on infinite strings. The main challenge in this research line is in the identification of classes of systems that admit symbolic models. In this work we progress in this direction by enlarging the class of stochastic hybrid systems admitting such models: in particular we show that randomly switched stochastic systems, satisfying some incremental stability assumption, admit symbolic models.