Extending Causal Metamodeling to a non-Markovian Queue
Not on the map. Why?
Abstract (arXiv)
Metamodels for discrete-event simulations approximate the behavior of simulation models without running expensive simulations. Prior work introduced modular dynamic Bayesian networks (MDBNs) -- a class of metamodels that can estimate a range of probabilistic and causal queries (PCQs) using a single, trained model -- but the method was limited to Markovian systems. In this paper, we initiate an extension of MDBNs to non-Markovian queues by approximating non-exponential distributions using phase-type distributions. This approach raises novel challenges, including balancing metamodeling accuracy and tractability when choosing the number of phases, efficiently learning metamodel parameters, and choosing the sampling interval that is used to approximate a continuous-time simulation by a discrete-time MDBN. We provide preliminary solutions to these challenges, yielding the first causal metamodeling technique for non-Markovian systems. Experiments on a G/M/1 queue demonstrate that the MDBN can produce accurate answers to PCQs with orders-of-magnitude speedup of inference times relative to direct simulation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 11 references that are in the map. First posted on arXiv 30 May 2026.
Builds on
1 of 11 references.
References · 1
- 2013Tractable Inference for Complex Stochastic Processescited by 20
Built on by
Not cited yet.