Dynamic constraint satisfaction problems over models

• Published in: Software and systems modeling Vol. 11; no. 3; pp. 385 - 408
• Main Authors: Horvath, Akos, Varro, Daniel
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer-Verlag 01.07.2012; Springer Nature B.V
• Subjects: Compilers; Complex systems; Computer Science; Design engineering; Dynamical systems; Dynamics; Information Systems Applications (incl.Internet); Interpreters; IT in Business; Mathematical analysis; Mathematical models; Programming Languages; Programming Techniques; Searching; Software Engineering; Software Engineering/Programming and Operating Systems; Space exploration; Special Section Paper; Constraint satisfaction programming; Graph transformation; Dynamic constraint satisfaction programming; Flexible constraint satisfaction problem
• ISSN: 1619-1366; 1619-1374
• DOI: 10.1007/s10270-010-0185-5

In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools.