Symbolic models for retarded jump-diffusion systems

  title={Symbolic models for retarded jump-diffusion systems},
  author={Pushpak Jagtap and Majid Zamani},

Figures from this paper

Formal Synthesis of Stochastic Systems via Control Barrier Certificates
This article proposes the use of so-called control barrier certificate to solve simpler reachability tasks along with computing the corresponding controllers and probability bounds, and combines those controllers to obtain a hybrid control policy solving the considered problem.
Compositional Synthesis of Symbolic Models for Infinite Networks
Symbolic Models for a Class of Impulsive Systems
An approach for constructing symbolic models for a class of impulsive systems possessing some stability properties and it is shown that behaviors of the constructed symbolic models are approximately equivalent to those of theImpulsive systems.
Compositional Abstraction-Based Synthesis for Interconnected Systems: An Approximate Composition Approach
A notion of approximate composition is proposed which makes it possible to compute an abstraction of the global interconnected system from the abstractions of its components as well as an incremental procedure for the synthesis of controllers enforcing safety specifications.


Symbolic models for time‐varying time‐delay systems via alternating approximate bisimulation
This paper introduces the notion of incremental input‐delay‐to‐state stability and derives sufficient conditions for the existence of symbolic models that are shown to be alternating approximately bisimilar to the original system, and proves the computability of the proposed symbolic models in a finite number of steps.
Symbolic Control of Stochastic Systems via Approximately Bisimilar Finite Abstractions
The technique enables automated, correct-by-construction, controller synthesis for stochastic control systems, which are common mathematical models employed in many safety critical systems subject to structured uncertainty.
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
This paper shows that under standard assumptions ensuring incremental stability of a switched system, it is possible to construct a finite symbolic model that is approximately bisimilar to the original switched system with a precision that can be chosen a priori.
Towards scalable synthesis of stochastic control systems
This work proposes a novel abstraction technique for incrementally stable stochastic control systems, which does not require state-space discretization but only input set discretizations, and that can be potentially more efficient (and thus scalable) than existing approaches.
Mode sequences as symbolic states in abstractions of incrementally stable switched systems
The main novelty consists in using mode sequences of given length as symbolic states for the authors' abstractions and it is shown that the resulting symbolic models are approximately bisimilar to the original switched system.
Approximately bisimilar symbolic models for randomly switched stochastic systems
Approximations of Stochastic Hybrid Systems
The approximation framework is based on the recently developed notion of the so-called stochastic simulation functions, which can be used to rigorously quantify the distance or error between a system and its approximate abstraction.