We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent p...
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
In this article we propose a model of a tennis game simulation with synthetic actors as players and a referee. The behavior of these actors is based on their synthetic vision and ...
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and J¨ager [1], we apply the finite model property to “...