Analysis of a metamodel to estimate complexity of using a domain-specific language
Jonathan Sprinkle
Abstract
Jonathan Sprinkle
Abstract
This paper considers the complexity of building models by analyzing the structure of the metamodel that defines a domain-specific modeling language. An algorithm is presented that generates a state model to produce at least one instance of every model in the metamodel, and the complexity of that state model provides insight into the complexity of the modeling language.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper considers the complexity of building models by analyzing the structure of the metamodel that defines a domain-specific modeling language. An algorithm is presented that generates a state model to produce at least one instance of every model in the metamodel, and the complexity of that state model provides insight into the complexity of the modeling language.
Key concepts: Metamodeling, Computer science, Modeling language, Domain (mathematical analysis), Domain-specific language, Domain model, Domain analysis, State (computer science)