is similar to is generalization of multi-state agent-based simulation method StochSim nearest-neighbour algorithm Gillespie direct algorithm implicit-state Doob-Gillespie algorithm 2011-06-13 http://identifiers.org/isbn/3-540-76636-7 978-3-540-76636-0 AZ The algorithm uses a representation of the system together with a super-approximation of its ‘event horizon’ (all events that may happen next), and a specific correction scheme to obtain exact timings. Being completely local and not based on any kind of enumeration, this algorithm has a per event time cost which is independent of (i) the size of the set of generable species (which can even be infinite), and (ii) independent of the size of the system (ie, the number of agent instances). The algorithm can be refined, using concepts derived from the classical notion of causality, so that in addition to the above one also has that the even cost is depending (iii) only logarithmically on the size of the model (ie, the number of rules).