Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov chain (CTMC) that underlies such a JQN, is highly structured, however, of infinite size in as many dimensions as there are queues. We present CSL model checking algorithms for labeled JQNs. To do so, we rely on well-kn...

Improving protection against fluvial floods requires a better estimation of levee failure. We developed an assessment method failure probabilities for sliding, backward erosion, and overflowing each represented by fragility curves. tested two approaches to aggregate those curves into global curve respectively using: enveloping Monte-Carlo simulations. implemented this approach earthen reliabili...

Since the seminal work of Gilboa and Schmeidler [28, p. 142] a relation between decision making under ambiguity and robust Bayesian statistics has been hinted at, and indeed immediate similarities are quite evident. At the same time, a formal treatment of this topic and a complete characterization of the relation between the two approaches is still missing. The object of this paper is to …ll th...

Nonadditive expected utility models were developed for explaining preferences in settings where probabilities cannot be assigned to events. In the absence of probabilities, difficulties arise in the interpretation of likelihoods of events. In this paper we introduce a notion of revealed likelihood that is defined entirely in terms of preferences and that does not require the existence of (subje...

Bistable perception is fundamentally a dynamic process: Our perceptual experience continuously alternates when an ambiguous or rivalrous stimulus is observed. Here we present a method to analyze instantaneous measures of dominance and transition between percepts. The analysis extracts three time-varying probabilities. First, the transient preference represents the probability of perceiving one ...

The paper considers a single-server queue with fixedsize batch Poisson arrivals and exponential service times, a model that is useful for a buffer that accepts messages arriving as fixed size batches of packets and releases them one packet at time. Transient performance measures for queues have long been recognized as being complementary to the steady-state analysis. The focus of the paper is o...

This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent one. This is the opposite of what occurs on trees of sub-exponential growth.

This paper considers a nonstationary multiserver queuing model with abandonment and balking for inbound call centers. We present a continuous time Markov chain (CTMC) model which captures the important characteristics of an inbound call center and obtain a numerical solution for its transient state probabilities using uniformization method with steady-state detection.

SUMMARY. A simple series form is obtained for the transient state probabilities of a single server Markovian queue with finite waiting space whence all particular cases concerning infinite waiting space and steady-state situations can be derived straight away. Also the coefficients in the series satisfy iterative recurrence relations which enable fast and accurate numerical computations.

We extend qualitative reasoning with estimations of the relative likelihoods of the pos sible qualitative behaviors . We estimate the likelihoods by viewing the dynamics o f a system as a Markov chain over its transition graph. This corresponds to addin g probabilities to each of the transitions. The transition probabilities follow directl y from theoretical considerations in simple cases . In ...