abstract. We present a family of quantified epistemic logics for reasoning about knowledge in multi-agent systems. The language enjoys flexible terms with different denotations depending on the epis-temic context in which they are interpreted. We present syntax and semantics of the language formally and show completeness of an ax-iomatisation. We discuss… (More)
We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems… (More)
This paper addresses the problem of verification of multi-agent systems by means of symbolic model checking. It is shown how to adapt the techniques of bounded and unbounded model checking to verify temporal epistemic properties of multi-agent systems. We give details of these two techniques for the logic that extends CTLK by past modalities, and show how… (More)
We investigate the problem of locally monitoring contract regulated behaviours agent-based in web services. We encode contract clauses in service specifications by using extended timed automata. We propose a non intrusive local monitoring framework along with an API to monitor the fulfilment (or violation) of contractual obligations. We illustrate our… (More)
We compare interpreted systems and Kripke models as semantic structures for reasoning about knowledge. We deene a map from the class of systems to the class of Kripke frames, and another in the opposite direction , and study their properties and compositions. We show that the semantics based on systems is less general than that based on frames.
In this work, we present a new framework to dynamically load hardware accelerators on reconfigurable platforms (FPGAs). Provided a library of application-specific processors, we load on-the-fly the specific processor in the FPGA, and we transfer the execution from the CPU to the FPGA-based accelerator. Results show that significant speed-up can be obtained… (More)
We present a certain extension of temporal-epistemic logic CTLK, allowing for specification of parametric group knowledge properties. These properties allow for free variables, and we introduce a technique for synthesizing all the possible variable substitutions which make the given formula hold in a model. We present the relevant theory, and demonstrate… (More)
Il presente articolo descrive QLB (Quantiied Logic for Belief), una logica predicativa delle credenze, che costituisce una possibile estensione al prim'ordine del sistema modale questo articolo.