scientific article; zbMATH DE number 1444339
From MaRDI portal
Publication:4953376
Cited in
(70)- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Amir Pnueli and the dawn of hybrid systems
- On integration of event-based estimation and robust MPC in a feedback loop
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- An invariant-based approach to the design of hybrid control systems
- Approximate bisimulation relations for constrained linear systems
- Conservative time discretization: a comparative study
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- A discrete-event model of asynchronous quantised systems
- Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems
- Formal modelling, analysis and verification of hybrid systems
- Modular discrete time approximations of distributed hybrid automata
- Reachability problem considering running cost
- Reachability analysis of linear systems using support functions
- Modeling and verification of stochastic hybrid systems using HIOA: a case study on DNA replication
- Timed I/O automata: a complete specification theory for real-time systems
- Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems
- A control problem for affine dynamical systems on a full-dimensional polytope.
- Trajectory Based Verification Using Local Finite-Time Invariance
- Oscillation analysis of linearly coupled piecewise affine systems
- Parameter synthesis through temporal logic specifications
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Finite-time stability and stabilisation with polyhedral domains for linear systems
- Timed automata with observers under energy constraints
- Hybridization methods for the analysis of nonlinear systems
- Formal safety verification of non-deterministic systems based on probabilistic reachability computation
- Safe compositional network sketches: formal framework
- Automatic invariant generation for hybrid systems using ideal fixed points
- Counterexample-guided predicate abstraction of hybrid systems
- Rank properties of Poincaré maps for hybrid systems with applications to bipedal walking
- A computable and compositional semantics for hybrid systems
- Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
- Verification of Hybrid Systems
- Syntax and consistent equation semantics of hybrid Chi
- On the connections between PCTL and dynamic programming
- Quantifier-free encoding of invariants for hybrid systems
- Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming
- Accurate hybridization of nonlinear systems
- Identifiability of discrete-time linear switched systems
- Switching controller synthesis for delay hybrid systems under perturbations
- Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
- Understanding deadlock and livelock behaviors in hybrid control systems
- A generating function approach to the stability of discrete-time switched linear systems
- Convergence results for ant routing algorithms viastochastic approximation
- On a control algorithm for time-varying processor availability
- Real-time scheduling of mixture-of-experts systems with limited resources
- Stabilization of planar switched linear systems using polar coordinates
- Synthesis using approximately bisimilar abstractions, state-feedback controllers for safety specifications
- Bayesian statistical model checking with application to Simulink/Stateflow verification
- On infinity norms as Lyapunov functions for piecewise affine systems
- Computing reachable states for nonlinear biological models
- Approximating Continuous Systems by Timed Automata
- A novel unified framework for solving reachability and invariance problems
- Computing reachable sets for uncertain nonlinear monotone systems
- Provably safe and robust learning-based model predictive control
- Finite data-rate feedback stabilization of switched and hybrid linear systems
- Succinct discrete time approximations of distributed hybrid automata
- From synchronous programs to symbolic representations of hybrid systems
- Distributed Kalman filter algorithms for self-localization of mobile devices
- Hybrid Automata in Systems Biology: How Far Can We Go?
- A descent algorithm for the optimal control of constrained nonlinear switched dynamical systems
- Monte-Carlo techniques for falsification of temporal properties of non-linear hybrid systems
- Stealthy deception attacks on water SCADA systems
- Reachability and stabilization of discrete-time affine systems with disturbances
- Receding horizon control for temporal logic specifications
- Construction of parametric barrier functions for dynamical systems using interval analysis
- Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
- Comparison of overapproximation methods for stability analysis of networked control systems
- Compositional analysis for linear control systems
- Reachability computation for polynomial dynamical systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953376)
