| This dissertation discusses a parameterized approach to the compiling of model-based notations into input languages of formal-analysis tools, based on descriptions of the notations' semantics. The semantics of a model-based notation is complex, and formalizing it in a semantics-description language, such as structural operational semantics and higher-order logic, can be challenging and error-prone. We propose a new approach, called template semantics, to structure the semantics of model-based specification notations. We demonstrate how to use template-semantics descriptions to construct notation-specific model compilers, which ease the mapping of new notations or notation variants to analysis tools.; The basic computation model of template semantics is a non-concurrent, hierarchical transition system (HTS), whose execution semantics are parameterized. Semantics that are common among notations, e.g., the concept of an enabled transition are captured in the template, and a notation's distinct semantics, e.g., which events can enable transitions, are specified as parameters. HTSs can be combined by composition operators to form more complex, concurrent specifications. We provide the template semantics of seven composition operators and some of their variants; the operators define how multiple HTSs execute concurrently and how they communicate and synchronize with each other by exchanging events and data. The definitions of these operators use the template parameters to preserve notation-specific behaviour in composition. By separating a notation's step semantics from its composition operators, we simplify the definitions of both. |
