Verification validation and accreditation of simulation models
Proceedings of the 29th conference on Winter simulation
A methodology for cost-risk analysis in the statistical validation of simulation models
Communications of the ACM - Special issue on simulation modeling and statistical computing
Proceedings of the 32nd conference on Winter simulation
Model composability: formulating a research thrust: composable simulations
Proceedings of the 32nd conference on Winter simulation
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Encoding Object-Z in Isabelle/HOL
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Validation of simulation models
WSC '79 Proceedings of the 11th conference on Winter simulation - Volume 2
What Comes After the Semantic Web - PADS Implications for the Dynamic Web
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Analyzing static and temporal properties of simulation models
Proceedings of the 38th conference on Winter simulation
A Rule-based Approach to Syntactic and Semantic Composition of BOMs
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Principles of the Spin Model Checker
Principles of the Spin Model Checker
CODES: An Integrated Approach to Composable Modeling and Simulation
ANSS-41 '08 Proceedings of the 41st Annual Simulation Symposium (anss-41 2008)
Applying causal inference to understand emergent behavior
Proceedings of the 40th Conference on Winter Simulation
Proceedings of the 40th Conference on Winter Simulation
An Approach for Validation of Semantic Composability in Simulation Models
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
| Hi-index | 0.00 |
Validation of semantic composability is a non-trivial problem and a key step in component-based modeling and simulation. Recent work in semantic composability validation promise to reduce verification, validation, and accreditation efforts. However, the underlying cost of current validation approaches can undermine the promised benefits, and the trade-off between validation accuracy and validation cost is not well understood. In this paper we present, to the best of our knowledge, the first quantitative study on the cost of validating semantic composability. Firstly, validation approaches are categorized into techniques that validate general model properties, and techniques that validate model execution. Secondly, we focus on two key factors that influence validation cost, namely, simulation problem characteristics and the validation approach adopted. Our study covers four representative validation approaches, CD++ DEVS, Z-based DEVS, Petty and Weisel formal validation, and deny-validity, and for simplicity, we use computation time as a measure of validation cost. Based on a queueing network model with 1,000 components, the cost of validating general model properties accounts for 55% of total validation time, with the remaining 45% incurred by model execution validation. With respect to composition structure, a 10% increase in the fork and join component interconnections increases validation cost by more than half. In model execution validation, the time-based deny-validity approach is seven times more expensive than the timeless Petty and Weisel formalism.