Abstract. Using process simulation and AI search methods, we compare software reuse against other possible changes to a project. such as reducing functionality or improving the ski...
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
This paper advocates the use of a formal framework for analyzing simulation performance. Simulation performance is characterized based on the three simulation development process ...
The problem of searching for important factors in a simulation model is considered when the simulation output is subject to stochastic variation. Bettonvil and Kleijnen (1996) giv...