On the generality of event-graph models
From MaRDI portal
Publication:2890451
DOI10.1287/IJOC.1030.0053zbMATH Open1239.68033OpenAlexW2109973477MaRDI QIDQ2890451FDOQ2890451
Authors: Eric L. Savage, Lee W. Schruben, Enver Yücesan 
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0053
Recommendations
- System of interconnected graphs and simulation of discrete processes
- An extended event graph-based modelling method for parallel and distributed discrete-event simulation
- Logical models of discrete even systems: a comparative exposition
- On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
- scientific article; zbMATH DE number 4200091
Cited In (8)
- A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus
- Partitioned event graph: formalizing LP-based modelling of parallel discrete-event simulation
- Threshold agent networks: An approach to modelling and simulation
- Modeling paradigms for discrete event simulation
- On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
- An extended event graph-based modelling method for parallel and distributed discrete-event simulation
- System of interconnected graphs and simulation of discrete processes
- Logical models of discrete even systems: a comparative exposition
This page was built for publication: On the generality of event-graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890451)
