We consider a memoryless loss system with servers S = {1, . . . , J}, and with customer types C = {1, . . . , I}. Servers are multi-type, so that server j can serve a subset of customer types C(j). We show that the probabilities of assigning arriving customers to idle servers can be chosen in such a way that the Markov process describing the system is reversible, with a simple product form stat...

A path integral associated with a dynamical system is an integral of a memoryless function of the system variables which, when integrated along trajectories of the system, depends only on the value of the trajectory and its derivatives at the endpoints of the integration interval. In this paper we study path independence for linear systems and integrals of quadratic diierential forms. These not...

In this paper we use the parameter-dependent Lyapunov function framework developed by Haddad and Bernstein to address the problem of robust stabilization for systems with parametric uncertainty and system delay. The principal result involves the construction of a modified Riccati equation for characterizing a memoryless (delay-independent) feedback controller that guarantees robust stability in...

Model-checking the alternating-time temporal logics AT L and AT L∗ with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory ...

First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and ...

Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijecti...

It is well known that any finite state Markov decision process (MDP) has a deterministic memoryless policy that maximizes the discounted longterm expected reward. Hence for such MDPs the optimal control problem can be solved over the set of memoryless deterministic policies. In the case of partially observable Markov decision processes (POMDPs), where there is uncertainty about the world state,...