Verification of the TESLA protocol in MCMAS-X

We present MCMAS-X, an extension of the OBDD-based model checker MCMAS for multi-agent systems, to explicit and deductive knowledge. We use MCMAS-X to verify authentication properties in the TESLA secure stream protocol

Competence Checking for the Global E-Service Society Using Games

We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society will be composed of local sub-societies that will often be semi-open, viz., entrance of agents in a semi-open society is conditional to specific admission criteria. Assuming that a candidate agent provides an abstract description of their communicative skills, we present a test that a controller agent could perform in order to decide if a candidate agent should be admitted. We formulate this test by revisiting an existing knowledge representation framework based on games specified as extended logic programs. The resulting framework finds useful application in complex and inter-operable web-services construed as semi-open societies in support of the global vision known as the Semantic Web

Direct Probing of Gap States and Their Passivation in Halide Perovskites by High-Sensitivity, Variable Energy Ultraviolet Photoelectron Spectroscopy

Direct detection of intrinsic defects in halide perovskites (HaPs) by standard methods utilizing optical excitation is quite challenging, due to the low density of defects in most samples of this family of materials (≤10^{15} cm^{–3} in polycrystalline thin films and ≤10^{11} cm^{–3} in single crystals, except melt-grown ones). While several electrical methods can detect defect densities 2 eV) HaPs. By measuring HaP layers on both hole- and electron-contact layers, as well as single crystals without contacts, we conclude that the observed deep defects are intrinsic to the Br-based HaP, and we propose a passivation route via the incorporation of a 2D-forming ligand into the precursor solution

Direct Probing of Gap States and Their Passivation in Halide Perovskites by High Sensitivity, Variable Energy Ultraviolet Photoelectron Spectroscopy

Direct detection of intrinsic defects in halide perovskites (HaPs) by standard methods utilizing optical excitation is quite challenging, due to the low density of defects in most samples of this family of materials (≤10^{15} cm^{–3} in polycrystalline thin films and ≤10^{11} cm^{–3} in single crystals, except melt-grown ones). While several electrical methods can detect defect densities 2 eV) HaPs. By measuring HaP layers on both hole- and electron-contact layers, as well as single crystals without contacts, we conclude that the observed deep defects are intrinsic to the Br-based HaP, and we propose a passivation route via the incorporation of a 2D-forming ligand into the precursor solution

A semidefinite relaxation based branch-and-bound method for tight neural network verification

We introduce a novel method based on semidefinite program (SDP) for the tight and efficient verification of neural networks. The proposed SDP relaxation advances the present SoA in SDP-based neural network verification by adding a set of linear constraints based on eigenvectors. We extend this novel SDP relaxation by combining it with a branch-and-bound method that can provably close the relaxation gap up to zero. We show formally that the proposed approach leads to a provably tighter solution than the present SoA. We report experimental results showing that the proposed method outperforms baselines in terms of verified accuracy while retaining an acceptable computational overhead

LCMAS 2004 Preliminary Version Bounded Model Checking for Deontic Interpreted Systems

We propose a framework for the verification of multi-agent systems ’ specification by symbolic model checking. The language CTLKD (an extension of CTL) allows for the representation of the temporal evolution of epistemic states of the agents, as well as their correct and incorrect functioning behaviour. We ground our analysis on the semantics of deontic interpreted systems. The verification approach is based on an adaption of the technique of bounded model checking, a mainstream approach in verification of reactive systems. We test our results on a typical communication scenario: the bit transmission problem with faults. Key words: Bounded model checking, epistemic logic.