Infinite Games are an important tool in the synthesis of finite-state controllers for reactive systems. The interaction between the environment and the system is modeled by a finite graph. The specification that has to be satisfied by the controlled system is translated into a winning condition on the infinite paths of the graph. Then, a winning strategy is a controller that is correct with res...

objective: this study aimed to develop and validate a questionnaire to measure waiting anxiety . methods: this was a cross-sectional study. extensive review of literature and expert opinions were used to develop and validate the waiting anxiety questionnaire. a sample of 321 participants was recruited through random cluster sampling (n= 190 iranian men and n= 131 women). the participants filled...

We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and – for games with liveness requests as ...

Runs and patterns in a sequence of Bernoulli trials and multi-state trials have broadly been used for various purposes and in many areas of statistics and applied probability. Recently, Fu and Koutras (1994) developed a new method based on finite Markov chain imbedding technique to study the exact distributions for the number of specified runs and patterns in a sequence of Bernoulli trials. In ...

purpose: to evaluate the effect of early drainage of delayed suprachoroidal hemorrhage (sch) after glaucoma surgery. methods: these study reports seven cases of delayed supra-choroidal hemorrhage following glaucoma surgery managed with early drainage. in this series instead of waiting for 7 to 14 days for clot lysis, the sch was drained from the suprachoroidal space immediately after diagnosis....

We investigate the control problem of the optimal choice of idle server (if any) for arriving customer in order to minimize the mean system time (waiting time + service time). The considered MAP/MAP/N queue consists of a common infinite buffer and multiple identical servers with MAP service processes whose phases (internal states) are known. Customers arrive according to a MAP (whose phase is a...

We consider a finite buffer fluid queue receiving its input from the output of a Markovian queue with finite or infinite waiting room. The input flow into the fluid queue is thus characterized by a Markov modulated input rate process and we derive, for a wide class of such input processes, a procedure for the computation of the stationary buffer content of the fluid queue and the stationary ove...

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

We introduce an exact probabilistic description for L=2 of the Barabási model for the dynamics of a list of L tasks. This permits us to study the problem out of the stationary state and to solve explicitly the extremal limit case where a critical behavior for the waiting time distribution is observed. This behavior deviates at any finite time from that of the stationary state. We study also the...

The distributed parameters systems can be described by linear two-dimensional (dependent on two spatial directions) parabolic partial differential equations. Using the finite difference method a distributed parameters system can be transformed to a linear discrete state space model. The controller design based on this description is complicated because of the large dimension of the model. There...