This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Savage, E. L. Articles by Yücesan, E. Search for Related Content

On the Generality of Event-Graph Models

School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, USA
Industrial Engineering and Operations Research, University of California, Berkeley, California 94720-1777, USA
Technology Management Area, INSEAD, Boulevard de Constance, 77305 Fontainebleau Cedex, France
eric.savage{at}orie.cornell.edu
schruben{at}ieor.berkeley.edu
enver.yucesan{at}insead.edu

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.

Key words: simulation; applications; languages; networks-graphs
History: received August 2000; revised January 2003; revised June 2003; accepted June 2003.

This article has been cited by other articles:

				W. K. Chan and L. Schruben Optimization Models of Discrete-Event System Dynamics Operations Research, September 1, 2008; 56(5): 1218 - 1237. [Abstract] [PDF]