Structural and behavioral equivalence of simulation models
- 2 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 2 (1) , 82-103
- https://doi.org/10.1145/132277.132281
Abstract
It M sometimes desu-able to know when two different discrete-event simulation models are, in some sense, interchangeable; that is, whether or not the two models always have the same output when run under identical experimental conditions. This notion of behavioral equivalence, while conceptually simple, is difficult to define in a manner that is both useful and testable. It is difficult or impossible to assert that two simulations are behaviorally equivalent for all possible experiments. In this paper, we present an explicit and sensible defimtlon of behavioral equivalence. Unfortunately, like other definitions in the hterature, our definition is not testable in practice. However, using a general graph-theoretic specification of simulation models, which we call Simulation Graphs, we define a testable property related to behavioral equivalence which we refer to as structural equivalence. We then establish that structural equivalence (a testable property) implies behavioral equivalence (a meaningful property). This permits us to assess when it is safe to substitute one model for another. It then becomes possible to develop algorithms for addressing important problems in simulation model development and verification,Keywords
This publication has 8 references indexed in Scilit:
- In Memoriam: Robert G. Jeroslow (1942–1988)INFORMS Journal on Computing, 1989
- Event Graph Modelling for Simulation with an Application to Flexible Manufacturing SystemsManagement Science, 1988
- Transaction tagging in highly congested queueing simulationsQueueing Systems, 1988
- Simulation modeling with event graphsCommunications of the ACM, 1983
- The time and state relationships in simulation modelingCommunications of the ACM, 1981
- Efficient Planarity TestingJournal of the ACM, 1974
- Isomorphism of Planar Graphs (Working Paper)Published by Springer Nature ,1972
- A V2 algorithm for determining isomorphism of planar graphsInformation Processing Letters, 1971