activity
20182023
most citedRobust Invariant Sets Computation for Switched Discrete-Time Polynomial Systems

7 citations · 25 across the 18 of their papers we have counts for

collaborators

18 papers

eess.SY2023

Reach-avoid Controllers Synthesis for Safety Critical Systems

Bai Xue

In this paper we propose sufficient conditions to synthesizing reach-avoid controllers for deterministic systems modelled by ordinary differential equations and stochastic systems…

eess.SY2023★ 2 cited

Reachability Verification for Stochastic Discrete-time Dynamical Systems

Bai Xue

In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in…

eess.SY2023

Reach-avoid Verification using Lyapunov Densities

Bai Xue

Reach-avoid analysis combines the construction of safety and specific progress guarantees, and is able to formalize many important engineering problems. In this paper we study the…

cs.LO2022

Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

Qiuye Wang, Mingshuai Chen, Bai Xue +2

A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid s…

math.OC2022

Reach-avoid Verification Based on Convex Optimization

Bai Xue, Naijun Zhan, Martin Fränzle +2

In this paper we propose novel optimization-based methods for verifying reach-avoid (or, eventuality) properties of continuous-time systems modelled by ordinary differential equati…

math.OC2022★ 1 cited

Reach-Avoid Analysis for Polynomial Stochastic Differential Equations

Bai Xue, Naijun Zhan, Martin Fränzle

In this paper we propose a novel semi-definite programming approach that solves reach-avoid problems over open (i.e., not bounded a priori) time horizons for dynamical systems mode…

cs.LO2021★ 1 cited

Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming

Qiuye Wang, Mingshuai Chen, Bai Xue +2

A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid s…

eess.SY2021★ 1 cited

Switching Controller Synthesis for Delay Hybrid Systems under Perturbations

Yunjun Bai, Ting Gan, Li Jiao +3

Delays are ubiquitous in modern hybrid systems, which exhibit both continuous and discrete dynamical behaviors. Induced by signal transmission, conversion, the nature of plants, an…

eess.SY2020★ 3 cited

PAC Model Checking of Black-Box Continuous-Time Dynamical Systems

Bai Xue, Miaomiao Zhang, Arvind Easwaran +1

In this paper we present a novel model checking approach to finite-time safety verification of black-box continuous-time dynamical systems within the framework of probably approxim…

math.DS2020★ 1 cited

Unbounded-Time Safety Verification of Stochastic Differential Dynamics

Shenghua Feng, Mingshuai Chen, Bai Xue +2

In this paper, we propose a method for bounding the probability that a stochastic differential equation (SDE) system violates a safety specification over the infinite time horizon.…

eess.SY2019

Synthesizing Invariant Clusters for Polynomial Programs by Semidefinite Programming

Qiuye Wang, Lihong Zhi, Naijun Zhan +2

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structu…

eess.SY2018★ 2 cited

Over- and Under-Approximating Reachable Sets for Perturbed Delay Differential Equations

Bai Xue, Qiuye Wang, Shenghua Feng +1

This note explores reach set computations for perturbed delay differential equations (DDEs). The perturbed DDEs of interest in this note is a class of DDEs whose dynamics are subje…

eess.SY2018

Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems

Bai Xue, Qiuye Wang, Naijun Zhan +2

In this paper we propose a novel semi-definite programming based method to compute robust domains of attraction for state-constrained perturbed polynomial systems. A robust domain…

cs.DM2018★ 7 cited

Robust Invariant Sets Computation for Switched Discrete-Time Polynomial Systems

Bai Xue, Naijun Zhan

In this paper we study the robust invariant sets generation problem for discrete-time switched polynomial systems subject to disturbance inputs within the optimal control framework…

math.OC2018★ 1 cited

Reach-Avoid Differential Games Based on Invariant Generation

Bai Xue, Qiuye Wang, Naijun Zhan +2

Reach-avoid differential games play an important role in collision avoidance, motion planning and control of aircrafts, and related applications. The central problem is the computa…

math.OC2018★ 5 cited

Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties

Bai Xue, Martin Fränzle, Naijun Zhan

In this paper we propose a convex programming based method to address a long-standing problem of inner-approximating backward reachable sets of state-constrained polynomial systems…

math.DS2018

Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems

Bai Xue, Naijun Zhan, Yangjia Li

In this paper we propose a convex programming based method for computing robust regions of attraction for state-constrained perturbed discrete-time polynomial systems. The robust r…

math.OC2018★ 1 cited

Robust Non-termination Analysis of Numerical Software

Bai Xue, Naijun Zhan, Yangjia Li +1

Numerical software are widely used in safety-critical systems such as aircrafts, satellites, car engines and so on, facilitating dynamics control of such systems in real time, it i…