The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Asymptotic Optimization of a Nonlinear Hybrid System Governed by a Markov Decision Process
SIAM Journal on Control and Optimization
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
An Algorithm for the Approximative Analysis of Rectangular Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Decidable Model Checking of Probabilistic Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Towars a Theory of Stochastic Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Stochastic Hybrid Systems by Optimal Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Verification of hybrid systems based on counterexample-guided abstraction refinement
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Approximate abstraction of stochastic hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Bisimulation for general stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Continuous time and/or continuous distributions
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Measurability and safety verification for stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Quantitative automata model checking of autonomous stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Control design for specifications on stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
| Hi-index | 0.00 |
The interplay of random phenomena and continuous real-time control deserves increased attention for instance in wireless sensing and control applications Safety verification for such systems thus needs to consider probabilistic variations of systems with hybrid dynamics In safety verification of classical hybrid systems we are interested in whether a certain set of unsafe system states can be reached from a set of initial states In the probabilistic setting, we may ask instead whether the probability of reaching unsafe states is below some given threshold In this paper, we consider probabilistic hybrid systems and develop a general abstraction technique for verifying probabilistic safety problems This gives rise to the first mechanisable technique that can, in practice, formally verify safety properties of non-trivial continuous-time stochastic hybrid systems—without resorting to point-wise discretisation Moreover, being based on arbitrary abstractions computed by tools for the analysis of non-probabilistic hybrid systems, improvements in effectivity of such tools directly carry over to improvements in effectivity of the technique we describe We demonstrate the applicability of our approach on a number of case studies, tackled using a prototypical implementation.