We refine our algebraic axiomatization in [8,9] of epistemic actions and epistemic update (notions defined in [5,6] using Kripke-style semantics), to incorporate a mechanism for d...
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties...
It has been recognised for some time that there are close links between the various logics developed for the analysis of multi-agent systems and the many game-theoretic models dev...
Paolo Ballarini, Michael Fisher, Michael Wooldridg...
In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the featu...
Matteo Baldoni, Guido Boella, Leendert W. N. van d...
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...