We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
We model the well-known Sum-and-Product problem in a modal logic, and verify its solution in a model checker. The modal logic is public announcement logic. The riddle is then imple...
We introduce a new type of arrow in the update frames (or “action models”) of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in m...
Model checking Web service behaviour has remained limited to checking safety and liveness properties. However when viewed as a multi agent system, the system composition can be ana...
Alessio Lomuscio, Hongyang Qu, Marek J. Sergot, Mo...