Jump to content

Event relationship graph

Add links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Runabout5921 (talk | contribs) at 22:17, 4 October 2023 (#suggestededit-add 1.0). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Event relationship graphs (ERGs) are a type of directed graph (with labeled and annotated vertices and annotated edges) used for modeling discrete-event systems. Like Petri Nets, ERGs provide a model for concurrent computation. ERGs have the full power of Turing machines.[1]

References

[edit]
  1. ^ Savage, E. L.; Schruben, L. W.; Yucesan, E. (2005). "On the Generality of Event Relationship Graph Models". INFORMS Journal on Computing. 17 (1): 3–9. doi:10.1287/ijoc.1030.0053.

Further reading

[edit]
  • Schruben, L. (2007), Modeling Causality with Event Relationship Graphs, in Fishwick, P.A (2007), Handbook of Dynamic System Modeling, pp. 23–1—23–21.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Event_relationship_graph&oldid=1178633085"