Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is t...
Web services are self-contained, modular units of application logic which provide business functionality to other applications via Internet connections. Several models have been u...
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...