People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
In this paper, it is shown that it is challenging to evaluate service fairness in multi-hop wireless networks due to intra-flow contention and unequal channel capacity. The convent...
Ping Wang, Hai Jiang, Weihua Zhuang, H. Vincent Po...
In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the exist...
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...