A decompositional proof scheme for automated convergence proofs of stochastic hybrid systems

DOI10.1007/978-3-642-04761-9_13MaRDI QIDQ3648697zbMATH OpenOpenAlexFDO

Authors Jens Oehlerking, Oliver Theel

Publication date 1 December 2009

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04761-9_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semidefinite programming (90C22) Stochastic stability in control theory (93E15) Hybrid systems of ordinary differential equations (34A38)

Recommendations

• Stability verification for a class of stochastic hybrid systems by semidefinite programming
• Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
• scientific article; zbMATH DE number 2164164
• A compositional modelling and verification framework for stochastic hybrid systems
• Quantitative automata model checking of autonomous stochastic hybrid systems

Describes a project that uses

Uses Software

• CSDP

This page was built for publication: A decompositional proof scheme for automated convergence proofs of stochastic hybrid systems

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