Computing bounded reach sets from sampled simulation traces

DOI10.1145/2185632.2185676MaRDI QIDQ2986775zbMATH OpenOpenAlexFDO

Authors Zhenqi Huang, Sayan Mitra

Publication date 16 May 2017

Published in Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2185632.2185676

zbMATH Keywords

hybrid systemverification

Mathematics Subject Classification ID

Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Recommendations

• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 727923
• A stochastic approximation method for reachability computations
• scientific article; zbMATH DE number 177512
• Towards optimal simulations of formulas by bounded-width programs
• scientific article; zbMATH DE number 4048505
• Set oriented methods for computing reachable sets and control sets
• Sampling polynomial trajectories for LTL verification
• scientific article; zbMATH DE number 903911

Cited in

(5)

• Bounded invariant verification for time-delayed nonlinear networked dynamical systems
• Computing distances between reach flowpipes
• Bounded verification with on-the-fly discrepancy computation
• Bounded and Unbounded Safety Verification Using Bisimulation Metrics
• Probabilistic reachability of discrete-time nonlinear stochastic systems

Describes a project that uses

Uses Software

• GRKLib
• Hybrid Trace Verifier
• StateFlow
• S-TaLiRo
• Simulink

This page was built for publication: Computing bounded reach sets from sampled simulation traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986775)