In this paper we study the complexity of Hornets, an algebraic extension of object nets. We define a restricted class: safe, elementary Hornets, to guarantee finite state spaces.
We have shown previously that the reachability problem for this class requires at least exponential space, which is a major increase when compared to safe, elementary object nets, which require polynomial space.
Here, we show how a safe, elementary Hornets can be simulated by a safe Eos, which establishes an upper bound for the complexity, since we know that that the reachability problem for safe Eos is PSpace-complete.