Consider a graph having quantum systems lying at each node. Suppose that the whole thing
evolves in discrete time steps, according to a global, unitary causal operator. By causal we …

Model-based offline Reinforcement Learning (RL) allows agents to fully utilise pre-collected
datasets without requiring additional or unethical explorations. However, applying model …

We propose a new method to quantify the impact of cyber attacks in Cyber Physical Systems
(CPSs). In particular, our method allows to identify the Design Parameter (DPs) affected due …

In this paper, we consider Global Graph Transformations where all occurrences of a set of
predefined local rules are applied altogether synchronously so that each part of the original …

It is well-known that cellular automata can be characterized as the set of translation-invariant
continuous functions over a compact metric space; this point of view makes it easy to extend …

Using the previously developed concepts of semantic spacetime, I explore the interpretation
of knowledge representations, and their structure, as a semantic system, within the …

We extend the theory of cellular automata to arbitrary, time-varying graphs. In other words
we formalise, and prove theorems about, the intuitive idea of a labelled graph which evolves …

Abstract Causal Graph Dynamics extend Cellular Automata to arbitrary time-varying graphs
of bounded degree. The whole graph evolves in discrete time steps, and this global …

On the one side, the formalism of Global Transformations comes with the claim of capturing
any transformation of space that is local, synchronous and deterministic. The claim has been …

Consider a network that evolves reversibly, according to nearest neighbours interactions.
Can its dynamics create/destroy nodes? On the one hand, since the nodes are the principal …