Verification and Control of Probabilistic Rectangular Hybrid Automata

DOI10.1007/978-3-319-22975-1_1zbMath1465.68183OpenAlexW2213331729MaRDI QIDQ2945577

Jeremy Sproston

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2318/1568125

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Safety verification for probabilistic hybrid systems
• A survey of stochastic \(\omega \)-regular games
• The algorithmic analysis of hybrid systems
• Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
• State explosion in almost-sure probabilistic reachability
• What's decidable about hybrid automata?
• Automatic verification of real-time systems with discrete probability distributions.
• O-minimal hybrid systems.
• Measurability and safety verification for stochastic hybrid systems
• Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
• STORMED Hybrid Systems
• Expected Reachability-Time Games
• Supervisory Control of a Class of Discrete Event Processes
• Algorithmic analysis of nonlinear hybrid systems
• Validation of Stochastic Systems
• Solving Sequential Conditions by Finite-State Strategies
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Verification and Control of Probabilistic Rectangular Hybrid Automata