On the generality of event-graph models

On the generality of event-graph models

0.00 Avg rating0 Votes
Article ID: iaor2007381
Country: United States
Volume: 17
Issue: 1
Start Page Number: 3
End Page Number: 9
Publication Date: Dec 2005
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: simulation
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.

Reviews

Required fields are marked *. Your email address will not be published.