On the Complexity of Safe, Elementary Hornets.
Michael Köhler-Bußmeier · 2012
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. It will turn out, that the reachability problem for this class requires exponential space, which is a major increase when compared to safe, elementary object nets, which require polynomial space.