@InProceedings{PascualLangeEA2025,
title = {Towards Examining the Complexity of Consistency},
author = {Romain Pascual and
Arne Lange and
Thomas Weber and
Lars K{\"{o}}nig and
Michael Kirsten and
Terru St{\"{u}}binger},
year = {2025},
booktitle = {{ACM/IEEE} 28th International Conference on Model
Driven Engineering Languages and Systems Companion
({MODELS-C} 2025)},
venue = {Grand Rapids, {MI}, {USA}},
eventdate = {2025-10-05/2025-10-10},
publisher = {{IEEE} Computer Society},
editor = {Marouane Kessentini and
Shaukat Ali and
Houari Sahraoui},
abstract = {Modeling and model-driven processes offer abstraction as a
means to cope with the increasing complexity of systems. As
systems become more complex, additional stakeholders with
diverse expertise contribute, leading to heterogeneous and
federated models, each capturing a different perspective and
abstraction. Since these models describe overlapping aspects
of the same system, some information is shared, and thus
redundancy is introduced. Maintaining consistency of such
information across models is crucial to ensure that they
collectively provide a coherent system representation. In
fact, inconsistencies can lead to errors in system
development, making consistency necessary for system
correctness. In addition, when the system is critical to
safety, the correctness must be established with the highest
level of guarantee, for example, achieved by formal
verification. In this context, understanding which aspects of
the consistency’s complexity influence the complexity of
verification may allow for more efficient verification
techniques. In this paper, we examine the complexity of
consistency for managing and mitigating verification efforts,
to ultimately systematically reduce unnecessary complexity
while ensuring the required consistency.},
pages = {663--672},
month = oct,
doi = {10.1109/MODELS-C68889.2025.00091}
}
Towards Examining the Complexity of Consistency
| Author(s): | Romain Pascual, Arne Lange, Thomas Weber, Lars König, Michael Kirsten, and Terru Stübinger |
|---|---|
| In: | ACM/IEEE 28th International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C 2025) |
| Publisher: | IEEE Computer Society |
| Year: | 2025 |
| Pages: | 663-672 |
| DOI: | 10.1109/MODELS-C68889.2025.00091 |
Abstract
Modeling and model-driven processes offer abstraction as a means to cope with the increasing complexity of systems. As systems become more complex, additional stakeholders with diverse expertise contribute, leading to heterogeneous and federated models, each capturing a different perspective and abstraction. Since these models describe overlapping aspects of the same system, some information is shared, and thus redundancy is introduced. Maintaining consistency of such information across models is crucial to ensure that they collectively provide a coherent system representation. In fact, inconsistencies can lead to errors in system development, making consistency necessary for system correctness. In addition, when the system is critical to safety, the correctness must be established with the highest level of guarantee, for example, achieved by formal verification. In this context, understanding which aspects of the consistency’s complexity influence the complexity of verification may allow for more efficient verification techniques. In this paper, we examine the complexity of consistency for managing and mitigating verification efforts, to ultimately systematically reduce unnecessary complexity while ensuring the required consistency.