QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
This talk will provide an overview of work that I have done with Hana Chockler, Orna Kupferman, and Judea Pearl [1, 2, 10, 9] on defining notions such as causality, explanation, ...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
New mobile access networks provide reasonable high bandwidth to allow true internet access. This paper models two dominant applications of those networks. One application, WAP, is...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...