Composability is the capability to select and assemble simulation components in various combinations into simulation systems. The defining characteristic of composability is the ability to combine and recombine components. Composability exists in two forms, syntactic and semantic (also known as engineering and modeling). Syntactic composability is the implementation of components so that they can be combined. Semantic composability is the question of whether the models embodied by the composed components can be meaningfully composed. A theory of semantic composability has been developed that examines the semantic composability of models using formal definitions and reasoning. In this paper results of semantic composability theory concerned with validity are presented. After briefly restating formal definitions of model and simulation, labeled transition systems are defined and introduced as models of the computation of models and compositions. Bisimulation, which is a general relation between the states of labeled transition simulations, is specialized with the addition of a validity metric, and shown to serve as a formal definition of validity. The power of different validity metrics to represent application-specific validity is explained. Classes of models are defined and compared with the models used in simulation. Certain classes of models and validity metrics for which validity is (or is not) preserved under composition are defined and their validity (or lack thereof) under composition is proven.
[1]
Markus Roggenbach,et al.
Towards a unified view of bisimulation: a comparative study
,
2000,
Theor. Comput. Sci..
[2]
James L. Hein.
Discrete Structures, Logic, and Computability , Second Edition
,
2002
.
[3]
Kenneth W. Regan,et al.
Computability
,
2022,
Algorithms and Theory of Computation Handbook.
[4]
Rudolph Sommerhalder,et al.
The theory of computability - programs, machines, effectiveness and feasibility
,
1988,
International computer science series.
[5]
Sze-Tsen Hu.
Elementary functions and coordinate geometry
,
1970
.
[6]
Elaine J. Weyuker,et al.
Computability, complexity, and languages - fundamentals of theoretical computer science
,
2014,
Computer science and applied mathematics.
[7]
Martin D. Davis,et al.
Computability and Unsolvability
,
1959,
McGraw-Hill Series in Information Processing and Computers.
[8]
Pascal Raymond,et al.
The synchronous data flow programming language LUSTRE
,
1991,
Proc. IEEE.
[9]
A. Turing.
On Computable Numbers, with an Application to the Entscheidungsproblem.
,
1937
.
[10]
Gunnar Stålmarck,et al.
Formal Verification in Railways
,
1999
.