In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
There are numerous cases where a reasoning agent needs to reason about the behavior of an opponent agent. In this paper, we propose a hybrid probabilistic logic language within wh...
Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. S...
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...