Higher-order approximations for verification of stochastic hybrid systems

DOI10.1007/978-3-642-33386-6_32MaRDI QIDQ4649312zbMATH OpenOpenAlexFDO

Authors Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate

Publication date 21 November 2012

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-33386-6_32

zbMATH Keywords

bounded-until and reach-avoidgeneral state-space Markov processesinterpolation theoryPCTL verificationstochastic hybrid systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Approximate model checking of stochastic hybrid systems
• Finite state approximation for verification of partially observable stochastic hybrid systems
• Probabilistic verification and approximation
• Approximate probabilistic verification of hybrid systems
• Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems

Cited in

(8)

• Automated verification and synthesis of stochastic hybrid systems: a survey
• Measurability and safety verification for stochastic hybrid systems
• Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
• Finite state approximation for verification of partially observable stochastic hybrid systems
• Dynamic Bayesian networks for formal verification of structured stochastic processes
• Approximate probabilistic verification of hybrid systems
• Symbolic control for stochastic systems via finite parity games
• Approximate model checking of stochastic hybrid systems

This page was built for publication: Higher-order approximations for verification of stochastic hybrid systems

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