On the Generality of Event-Graph Models
Eric L. Savage, Lee W. Schruben, Enver Yücesan
INFORMS Journal on Computing · 2005 · Volume 17 · Issue 1
Abstract
Event graphs model the dynamics of a discrete-event simulation model. This paper demonstrates the modeling power of event graphs by presenting a model that simulates a Turing machine. Therefore, according to Church's thesis, event-graph models are able to model any system that can be implemented on a modern computer. Theoretical and practical implications of this assertion are also discussed.
Keywords
simulation, applications, languages, networks-graphs
Enable JavaScript for citation tools and additional paper interactions.