Bounded Verification of Reachability of Probabilistic Hybrid Systems

No abstract is available for this paper.

• Publication year

  2018

• Venue

  International Conference on Quantitative Evaluation of Systems

• Publication date

  2018-09-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-99154-2_15
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Abstraction Based Reachability Analysis for Finite Branching Stochastic Hybrid Systems

  2017cited by this paper
• νZ - An Optimizing SMT Solver

  2015cited by this paper
• Recharging Probably Keeps Batteries Alive

  2015cited by this paper
• SReach: A Probabilistic Bounded Delta-Reachability Analyzer for Stochastic Hybrid Systems

  2015cited by this paper
• Symbolic optimization with SMT solvers

  2014cited by this paper
• Reachability in MDPs: Refining Convergence of Value Iteration

  2014cited by this paper
• ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems

  2014cited by this paper
• Time-Bounded Reachability Probabilities in Continuous-Time Markov Decision Processes

  2010cited by this paper
• Safety Verification for Probabilistic Hybrid Systems

  2010cited by this paper
• Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem

  2010cited by this paper
• Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems

  2008cited by this paper
• Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems

  2008cited by this paper
• An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems

  2008cited by this paper
• Reachability analysis of uncertain systems using bounded-parameter Markov decision processes

  2008cited by this paper
• Probabilistic reachability analysis for large scale stochastic hybrid systems

  2007cited by this paper
• Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems

  2007cited by this paper
• Toward a General Theory of Stochastic Hybrid Systems

  2006cited by this paper
• Reachability in Recursive Markov Decision Processes

  2006cited by this paper
• Reachability Analysis for Controlled Discrete Time Stochastic Hybrid Systems

  2006cited by this paper
• Verifying Industrial Hybrid Systems with MathSAT

  2005cited by this paper
• Efficient Proof Engines for Bounded Model Checking of Hybrid Systems

  2005cited by this paper
• PHAVer: algorithmic verification of hybrid systems past HyTech

  2005cited by this paper
• Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement

  2005cited by this paper
• Mathematical techniques for analyzing concurrent and probabilistic systems

  2004cited by this paper
• Extended Stochastic Hybrid Systems and Their Reachability Problem

  2004cited by this paper
• Reachability Analysis of Probabilistic Systems by Successive Refinements

  2001cited by this paper
• Decidable Model Checking of Probabilistic Hybrid Automata

  2000cited by this paper
• A New Class of Decidable Hybrid Systems

  1999cited by this paper
• The theory of hybrid automata

  1996cited by this paper

• Modeling and Verification Methods for Spatio-Temporal Consistency of CPS in Uncertain Environments

  2024cites this paper
• A stochastic approximation method for probability prediction of docking success for aerial refueling

  2021cites this paper
• Safety Analysis of Linear Discrete-time Stochastic Systems: Work-in-Progress

  2020cites this paper
• Anytime Guarantees for Reachability in Uncountable Markov Decision Processes

  2020cites this paper
• Counterexample Guided Abstraction Refinement for Polyhedral Probabilistic Hybrid Systems

  2019cites this paper