Dynamic constraint satisfaction problems over models

Ákos Horváth, D. Varró

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)385-408
Number of pages24
JournalSoftware and Systems Modeling
Volume11
Issue number3
DOIs
Publication statusPublished - Jul 2012

Fingerprint

Constraint satisfaction problems
Constraint Satisfaction Problem
Dynamic Problem
Design Space Exploration
Model
Model Transformation
Evaluation
Multiple Models
Graph Model
Engineering Application
Numerics
Sort
Complex Systems
Prototype
Valid
Synthesis
Restriction
Engineering
Metric
Design

Keywords

  • Constraint satisfaction programming
  • Dynamic constraint satisfaction programming
  • Flexible constraint satisfaction problem
  • Graph transformation

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation

Cite this

Dynamic constraint satisfaction problems over models. / Horváth, Ákos; Varró, D.

In: Software and Systems Modeling, Vol. 11, No. 3, 07.2012, p. 385-408.

Research output: Contribution to journalArticle

@article{d9418af2945e4a898aeadc65fd76222e,
title = "Dynamic constraint satisfaction problems over models",
abstract = "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.",
keywords = "Constraint satisfaction programming, Dynamic constraint satisfaction programming, Flexible constraint satisfaction problem, Graph transformation",
author = "{\'A}kos Horv{\'a}th and D. Varr{\'o}",
year = "2012",
month = "7",
doi = "10.1007/s10270-010-0185-5",
language = "English",
volume = "11",
pages = "385--408",
journal = "Software and Systems Modeling",
issn = "1619-1366",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - Dynamic constraint satisfaction problems over models

AU - Horváth, Ákos

AU - Varró, D.

PY - 2012/7

Y1 - 2012/7

N2 - 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.

AB - 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.

KW - Constraint satisfaction programming

KW - Dynamic constraint satisfaction programming

KW - Flexible constraint satisfaction problem

KW - Graph transformation

UR - http://www.scopus.com/inward/record.url?scp=84855432269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855432269&partnerID=8YFLogxK

U2 - 10.1007/s10270-010-0185-5

DO - 10.1007/s10270-010-0185-5

M3 - Article

VL - 11

SP - 385

EP - 408

JO - Software and Systems Modeling

JF - Software and Systems Modeling

SN - 1619-1366

IS - 3

ER -