We present a framework for verifying temporal and epistemic properties of multi-agent
systems by means of bounded model checking. We use interpreted systems as underlying …

We investigate the problem of verifying the strategic properties of multi-agent systems
equipped with machine learningbased perception units. We introduce a novel model of …

We introduce a model for agent-environment systems where the agents are implemented via
feed-forward ReLU neural networks and the environment is non-deterministic. We study the …

We study the problem of verifying role-based multi-agent systems, where the number of
components cannot be determined at design time. We give a semantics that captures …

Verification of real-time systems is an important subject of research. This is highly motivated
by an increasing demand to verify safety critical systems, ie, time-dependent distributed …

Modern satisfiability (SAT) solvers have become the enabling technology of many model
checkers. In this chapter, we will focus on those techniques most relevant to industrial …

Power supply underpowering and negative power supply glitches are commonly used for
the purpose of injecting faults into secure circuits. The related fault injection mechanism has …

We present an algorithm for model checking temporal-epistemic properties of multi-agent
systems, expressed in the formalism of interpreted systems. We first introduce a technique …

This paper shows how bounded model checking can be applied to parameter synthesis for
parametric timed automata with continuous time. While it is known that the general problem …

The CTL learning problem consists in finding for a given sample of positive and negative
Kripke structures a distinguishing CTL formula that is verified by the former but not by the …