Reachability analysis using message passing over tree decompositions

DOI10.1007/978-3-030-53288-8_30zbMath1478.68173OpenAlexW3042780501MaRDI QIDQ2225129

Sriram Sankaranarayanan

Publication date: 4 February 2021

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) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Symbolic dynamics (37B10)

Related Items (1)

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