Reachability analysis using message passing over tree decompositions

DOI10.1007/978-3-030-53288-8_30MaRDI QIDQ2225129zbMATH OpenOpenAlexFDO

Authors Sriram Sankaranarayanan

Publication date 4 February 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-53288-8_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Symbolic dynamics (37B10) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03)

Recommendations

• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
• Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
• Reachability analysis of non-linear planar autonomous systems
• Hybrid Systems: Computation and Control
• Reachability analysis of polynomial systems using linear programming relaxations

Cited in

(4)

• A tree structure approach to reachability analysis
• scientific article; zbMATH DE number 4128405 (Why is no real title available?)
• Applying Step Coverability Trees to Communicating Component-Based Systems
• Synthesizing ReLU neural networks with two hidden layers as barrier certificates for hybrid systems

This page was built for publication: Reachability analysis using message passing over tree decompositions

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