The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems and game-like multi-agent systems. In this article, we investigate the computational complexity of the satisfiability problem for ATL. For the case where the set of agents is fixed in advance, this problem was settled a...

We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag’s defi...

This chapter offers a novel defence of Szasz’s claim that mental illness is a myth by bringing to bear a standard type of thought experiment used in philosophical discussions of the meaning of natural kind concepts. This makes it possible to accept Szasz’s conclusion that mental illness involves problems of living, some of which may be moral in nature, while bypassing the debate about the meani...