Verification and control for probabilistic hybrid automata with finite bisimulations

DOI10.1016/j.jlamp.2018.11.001zbMath1417.68105OpenAlexW2900091779WikidataQ128966315 ScholiaQ128966315MaRDI QIDQ1734511

Jeremy Sproston

Publication date: 27 March 2019

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

zbMATH Keywords

hybrid automataprobabilistic gamesprobabilistic model checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Preface to the special issue on open problems in concurrency theory

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expected reachability-time games
• Safety verification for probabilistic hybrid systems
• A survey of stochastic \(\omega \)-regular games
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
• The algorithmic analysis of hybrid systems
• State explosion in almost-sure probabilistic reachability
• Performance analysis of probabilistic timed automata using digital clocks
• Bisimulation through probabilistic testing
• What's decidable about hybrid automata?
• Automatic verification of real-time systems with discrete probability distributions.
• Discrete-time control for rectangular hybrid automata
• Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
• Model checking of probabilistic and nondeterministic systems
• Formal Verification and Synthesis for Discrete-Time Stochastic Systems
• Measurability and safety verification for stochastic hybrid systems
• On Probabilistic Alternating Simulations
• STORMED Hybrid Systems
• Algorithmic analysis of nonlinear hybrid systems
• On Optimal Control of Stochastic Linear Hybrid Systems
• Model Checking Linear-Time Properties of Probabilistic Systems
• O-Minimal Hybrid Reachability Games
• Hybrid Systems: Computation and Control
• Automata, Languages and Programming
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Verification and control for probabilistic hybrid automata with finite bisimulations